24. WG 1998: Smolenice Castle, Slovak Republic

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