nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fully dynamic algorithm for modular decomposition and recognition of cographs
|
Shamir, Ron |
|
2004 |
136 |
2-3 |
p. 329-340 12 p. |
artikel |
2 |
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
|
Detti, Paolo |
|
2004 |
136 |
2-3 |
p. 197-215 19 p. |
artikel |
3 |
Approximation algorithms for the watchman route and zookeeper's problems
|
Tan, Xuehou |
|
2004 |
136 |
2-3 |
p. 363-376 14 p. |
artikel |
4 |
Author index to volume
|
|
|
2004 |
136 |
2-3 |
p. 387-388 2 p. |
artikel |
5 |
3-Colorability ∈P for P 6-free graphs
|
Randerath, Bert |
|
2004 |
136 |
2-3 |
p. 299-313 15 p. |
artikel |
6 |
Complexity results on a paint shop problem
|
Epping, Th. |
|
2004 |
136 |
2-3 |
p. 217-226 10 p. |
artikel |
7 |
Contents
|
|
|
2004 |
136 |
2-3 |
p. ix-x nvt p. |
artikel |
8 |
Delay-related secondary objectives for rectilinear Steiner minimum trees
|
Peyer, Sven |
|
2004 |
136 |
2-3 |
p. 271-298 28 p. |
artikel |
9 |
Divider-based algorithms for hierarchical tree partitioning
|
Finocchi, Irene |
|
2004 |
136 |
2-3 |
p. 227-247 21 p. |
artikel |
10 |
Edge-oblique polyhedral graphs
|
Schreyer, Jens |
|
2004 |
136 |
2-3 |
p. 315-327 13 p. |
artikel |
11 |
Editorial Board
|
|
|
2004 |
136 |
2-3 |
p. v-vii nvt p. |
artikel |
12 |
Families of integral trees with diameters 4, 6, and 8
|
Wang, Ligong |
|
2004 |
136 |
2-3 |
p. 349-362 14 p. |
artikel |
13 |
Guide for authors
|
|
|
2004 |
136 |
2-3 |
p. I-IV nvt p. |
artikel |
14 |
Making a tournament k-arc-strong by reversing or deorienting arcs
|
Bang-Jensen, Jørgen |
|
2004 |
136 |
2-3 |
p. 161-171 11 p. |
artikel |
15 |
On approximability of linear ordering and related NP-optimization problems on graphs
|
Mishra, Sounaka |
|
2004 |
136 |
2-3 |
p. 249-269 21 p. |
artikel |
16 |
On treewidth approximations
|
Bouchitté, V |
|
2004 |
136 |
2-3 |
p. 183-196 14 p. |
artikel |
17 |
Preface
|
Faigle, Ulrich |
|
2004 |
136 |
2-3 |
p. 159-160 2 p. |
artikel |
18 |
Solving problems for maximal reducible flowgraphs
|
Vernet, O |
|
2004 |
136 |
2-3 |
p. 341-348 8 p. |
artikel |
19 |
Sparsest cuts and concurrent flows in product graphs
|
Bonsma, Paul |
|
2004 |
136 |
2-3 |
p. 173-182 10 p. |
artikel |
20 |
The obnoxious center problem on weighted cactus graphs
|
Zmazek, Blaž |
|
2004 |
136 |
2-3 |
p. 377-386 10 p. |
artikel |