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