24. WG 1998: Smolenice Castle, Slovak Republic

@proceedings{DBLP:conf/wg/1998,
  editor    = {Juraj Hromkovic and
               Ondrej S{\'y}kora},
  title     = {Graph-Theoretic Concepts in Computer Science, 24th International
               Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20,
               1998, Proceedings},
  booktitle = {WG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1517},
  year      = {1998},
  isbn      = {3-540-65195-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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