Abstract is missing.
- Linear Time Solvable Optimization Problems on Graphs of Bounded Clique WidthBruno Courcelle, Johann A. Makowsky, Udi Rotics. 1-16
- Minus Domination in Small-Degree GraphsPeter Damaschke. 17-25
- The Vertex-Disjoint Triangles ProblemVenkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong. 26-37
- Communication in the Two-Way Listen-in Vertex-disjoint Paths ModeHans-Joachim Böckenhauer. 38-49
- Broadcasting on Anonymous Unoriented ToriStefan Dobrev, Peter Ruzicka. 50-62
- Families of Graphs Having Broadcasting and Gossiping PropertiesGuillaume Fertin, André Raspaud. 63-77
- Optical All-to-All Communication in Inflated NetworksOlivier Togni. 78-87
- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex RankingHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. 88-99
- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-TreesShuji Isobe, Xiao Zhou, Takao Nishizeki. 100-113
- Rankings of Directed GraphsJan Kratochvíl, Zsolt Tuza. 114-123
- Drawing Planar Partitions II: HH-DrawingsTherese C. Biedl, Michael Kaufmann, Petra Mutzel. 124-136
- Triangles in Euclidean ArrangementsStefan Felsner, Klaus Kriegel. 137-148
- Interally Typed Second-Order Term GraphsWolfram Kahl. 149-163
- Compact Implicit Representation of GraphsMaurizio Talamo, Paola Vocca. 164-176
- Graphs with Bounded Induced DistanceSerafino Cicerone, Gabriele Di Stefano. 177-191
- Diameter Determination on Restricted Graph FaminliesDerek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul. 192-202
- Independent Tree SpannersDagmar Handke. 203-214
- Upgrading Bottleneck Constrained ForestsSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth. 215-226
- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian DecompositionGinette Gauyacq, C. Micheneau, André Raspaud. 227-241
- Improved Compressions of Cube-Connected Cycles NetworksRalf Klasing. 242-256
- Efficient Embeddings of Grids into GridsMarkus Röttger, Ulf-Peter Schroeder. 257-271
- Integral Uniform Flows in Symmetric NetworksFarhad Shahrokhi, László A. Székely. 272-284
- Splitting Number is NP-completeLuerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto. 285-297
- Tree Spanners in Planar GraphsSándor P. Fekete, Jana Kremer. 298-309
- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar GraphsKazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki. 310-323
- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying BasesKoichi Wada, Wei Chen. 324-336
- Domination and Steiner Tree Problems on Graphs with Few P4SLuitpold Babel, Stephan Olariu. 337-350
- Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal GraphsElias Dahlhaus. 351-358
- Interval Completion with the Smallest Max-degreeFedor V. Fomin, Petr A. Golovach. 359-371
- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a MinorKonstantin Yu. Gorbunov. 372-383