no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A flexible model and efficient solution strategies for discrete location problems
|
Marín, Alfredo |
|
2009 |
157 |
5 |
p. 1128-1145 18 p. |
article |
2 |
A generalization of Lucas polynomial sequence
|
Cheon, Gi-Sang |
|
2009 |
157 |
5 |
p. 920-927 8 p. |
article |
3 |
Average distances and distance domination numbers
|
Tian, Fang |
|
2009 |
157 |
5 |
p. 1113-1127 15 p. |
article |
4 |
Bi-cycle extendable through a given set in balanced bipartite graphs
|
Li, Hao |
|
2009 |
157 |
5 |
p. 1009-1015 7 p. |
article |
5 |
Complexity results for minimum sum edge coloring
|
Marx, Dániel |
|
2009 |
157 |
5 |
p. 1034-1045 12 p. |
article |
6 |
Computing sharp bounds for hard clustering problems on trees
|
Lari, Isabella |
|
2009 |
157 |
5 |
p. 991-1008 18 p. |
article |
7 |
Contents
|
|
|
2009 |
157 |
5 |
p. vii-viii nvt p. |
article |
8 |
Degree-bounded minimum spanning trees
|
Jothi, Raja |
|
2009 |
157 |
5 |
p. 960-970 11 p. |
article |
9 |
Domain extender for collision resistant hash functions: Improving upon Merkle–Damgård iteration
|
Sarkar, Palash |
|
2009 |
157 |
5 |
p. 1086-1097 12 p. |
article |
10 |
Editorial Board
|
|
|
2009 |
157 |
5 |
p. v-vi nvt p. |
article |
11 |
Efficient algorithms for wavelength assignment on trees of rings
|
Bian, Zhengbing |
|
2009 |
157 |
5 |
p. 875-889 15 p. |
article |
12 |
Enumeration of 2-regular circulant graphs and directed double networks
|
Mamut, Aygul |
|
2009 |
157 |
5 |
p. 1024-1033 10 p. |
article |
13 |
Extensive facility location problems on networks with equity measures
|
Puerto, Justo |
|
2009 |
157 |
5 |
p. 1069-1085 17 p. |
article |
14 |
Hamiltonian connectedness in 3-connected line graphs
|
Lai, Hong-Jian |
|
2009 |
157 |
5 |
p. 982-990 9 p. |
article |
15 |
Hypergraph decomposition and secret sharing
|
Di Crescenzo, Giovanni |
|
2009 |
157 |
5 |
p. 928-946 19 p. |
article |
16 |
Inducing regulation of any digraphs
|
Górska, Joanna |
|
2009 |
157 |
5 |
p. 947-952 6 p. |
article |
17 |
Linear CNF formulas and satisfiability
|
Porschen, Stefan |
|
2009 |
157 |
5 |
p. 1046-1068 23 p. |
article |
18 |
Linear codes for high payload steganography
|
Khatirinejad, Mahdad |
|
2009 |
157 |
5 |
p. 971-981 11 p. |
article |
19 |
Locating a minisum circle in the plane
|
Brimberg, Jack |
|
2009 |
157 |
5 |
p. 901-912 12 p. |
article |
20 |
On highly palindromic words
|
Holub, Štěpán |
|
2009 |
157 |
5 |
p. 953-959 7 p. |
article |
21 |
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures
|
Cao, Yinmei |
|
2009 |
157 |
5 |
p. 913-919 7 p. |
article |
22 |
Some complexity problems on single input double output controllers
|
Hangos, K.M. |
|
2009 |
157 |
5 |
p. 1146-1158 13 p. |
article |
23 |
The crossing numbers of generalized Petersen graphs with small order
|
Lin, Xiaohui |
|
2009 |
157 |
5 |
p. 1016-1023 8 p. |
article |
24 |
The forcing hull and forcing geodetic numbers of graphs
|
Tong, Li-Da |
|
2009 |
157 |
5 |
p. 1159-1163 5 p. |
article |
25 |
Unbordered partial words
|
Blanchet-Sadri, F. |
|
2009 |
157 |
5 |
p. 890-900 11 p. |
article |
26 |
Upper bounds on the upper signed total domination number of graphs
|
Shan, Erfang |
|
2009 |
157 |
5 |
p. 1098-1103 6 p. |
article |
27 |
Using a similarity measure for credible classification
|
Subasi, M. |
|
2009 |
157 |
5 |
p. 1104-1112 9 p. |
article |