| 159 | -- | 160 | Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink. Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization |
| 161 | -- | 171 | Jørgen Bang-Jensen, Anders Yeo. Making a tournament k-arc-strong by reversing or deorienting arcs |
| 173 | -- | 182 | Paul S. Bonsma. Sparsest cuts and concurrent flows in product graphs |
| 183 | -- | 196 | Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca. On treewidth approximations |
| 197 | -- | 215 | . A linear algorithm for the Hamiltonian completion number of the line graph of a cactus |
| 217 | -- | 226 | Thomas Epping, Winfried Hochstättler, Peter Oertel. Complexity results on a paint shop problem |
| 227 | -- | 247 | Irene Finocchi, Rossella Petreschi. Divider-based algorithms for hierarchical tree partitioning |
| 249 | -- | 269 | Sounaka Mishra, Kripasindhu Sikdar. On approximability of linear ordering and related NP-optimization problems on graphs |
| 271 | -- | 298 | Sven Peyer, Martin Zachariasen, David Grove Jørgensen. Delay-related secondary objectives for rectilinear Steiner minimum trees |
| 299 | -- | 313 | Bert Randerath, Ingo Schiermeyer. 3-Colorability in P for P::6::-free graphs |
| 315 | -- | 327 | Jens Schreyer, Hansjoachim Walther. Edge-oblique polyhedral graphs |
| 329 | -- | 340 | Ron Shamir, Roded Sharan. A fully dynamic algorithm for modular decomposition and recognition of cographs |
| 341 | -- | 348 | Oswaldo Vernet, Lilian Markenzon. Solving problems for maximal reducible flowgraphs |
| 349 | -- | 362 | Ligong Wang, Xueliang Li, Shenggui Zhang. Families of integral trees with diameters 4, 6, and 8 |
| 363 | -- | 376 | Xuehou Tan. Approximation algorithms for the watchman route and zookeeper s problems |
| 377 | -- | 386 | Blaz Zmazek, Janez Zerovnik. The obnoxious center problem on weighted cactus graphs |