| 1 | -- | 2 | Juraj Hromkovic, Ondrej Sýkora. Preface |
| 3 | -- | 21 | Serafino Cicerone, Gabriele Di Stefano. Graphs with bounded induced distance |
| 23 | -- | 52 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic |
| 53 | -- | 64 | Peter Damaschke. Minus domination in small-degree graphs |
| 65 | -- | 83 | Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto. SPLITTING NUMBER is NP-complete |
| 85 | -- | 103 | Sándor P. Fekete, Jana Kremer. Tree spanners in planar graphs |
| 105 | -- | 127 | Dagmar Handke. Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees |
| 129 | -- | 142 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth. Upgrading bottleneck constrained forests |
| 143 | -- | 173 | Markus Röttger, Ulf-Peter Schroeder. Efficient embeddings of grids into grids |
| 175 | -- | 191 | Farhad Shahrokhi, László A. Székely. Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem |
| 193 | -- | 210 | Maurizio Talamo, Paola Vocca. Representing graphs implicitly using almost optimal space |