|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
20 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A clique-difference encoding scheme for labelled k -path graphs |
Pereira, P.R.C. |
2008 |
156 | 17 |
p. 3216-3222 7 p. |
article |
|
| 2 | An efficient algorithm for the three-guard problem |
Tan, Xuehou |
2008 |
156 | 17 |
p. 3312-3324 13 p. |
article |
|
| 3 | A new formulation for the Traveling Deliveryman Problem |
Méndez-Díaz, Isabel |
2008 |
156 | 17 |
p. 3223-3237 15 p. |
article |
|
| 4 | Approximation algorithms for group prize-collecting and location-routing problems |
Glicksman, Hagai |
2008 |
156 | 17 |
p. 3238-3247 10 p. |
article |
|
| 5 | Constructions for normal graphs and some consequences |
Wagler, Annegret |
2008 |
156 | 17 |
p. 3329-3338 10 p. |
article |
|
| 6 | Contents |
2008 |
156 | 17 |
p. v-vi nvt p. |
article |
||
| 7 | Counting preimages of TCP reordering patterns |
Hansson, Anders |
2008 |
156 | 17 |
p. 3187-3193 7 p. |
article |
|
| 8 | Discrete approximations to real-valued leaf sequencing problems in radiation therapy |
Gunawardena, Athula |
2008 |
156 | 17 |
p. 3178-3186 9 p. |
article |
|
| 9 | Efficiency in exponential time for domination-type problems |
Schiermeyer, Ingo |
2008 |
156 | 17 |
p. 3291-3297 7 p. |
article |
|
| 10 | Equivalences and the complete hierarchy of intersection graphs of paths in a tree |
Golumbic, Martin Charles |
2008 |
156 | 17 |
p. 3203-3215 13 p. |
article |
|
| 11 | On a relation between the domination number and a strongly connected bidirection of an undirected graph |
Lätsch, Martin |
2008 |
156 | 17 |
p. 3194-3202 9 p. |
article |
|
| 12 | On the coverings of the d -cube for d ≤ 6 |
Emamy-K, M.R. |
2008 |
156 | 17 |
p. 3156-3165 10 p. |
article |
|
| 13 | Parameterized algorithmics for linear arrangement problems |
Fernau, Henning |
2008 |
156 | 17 |
p. 3166-3177 12 p. |
article |
|
| 14 | Preemptive scheduling and antichain polyhedra |
Quilliot, Alain |
2008 |
156 | 17 |
p. 3267-3275 9 p. |
article |
|
| 15 | Preface for CTW2005 special issue |
Faigle, Ulrich |
2008 |
156 | 17 |
p. 3155- 1 p. |
article |
|
| 16 | Randomized strategies for the plurality problem |
Král’, Daniel |
2008 |
156 | 17 |
p. 3305-3311 7 p. |
article |
|
| 17 | Semi-preemptive routing on trees |
Krumke, Sven O. |
2008 |
156 | 17 |
p. 3298-3304 7 p. |
article |
|
| 18 | The connectivity of a graph and its complement |
Hellwig, Angelika |
2008 |
156 | 17 |
p. 3325-3328 4 p. |
article |
|
| 19 | The stack loading and unloading problem |
Malucelli, Federico |
2008 |
156 | 17 |
p. 3248-3266 19 p. |
article |
|
| 20 | Topological sweep of the complete graph |
Rafalin, Eynat |
2008 |
156 | 17 |
p. 3276-3290 15 p. |
article |
20 results found