Graph-Theoretic Concepts in Computer Science

1. Front Matter

   Pages I-XI

   PDF

2. Maximum Cardinality Search for Computing Minimal Triangulations

   • Anne Berry, Jean R. S. Blair, Pinar Heggernes

   Pages 1-12

3. DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

   • Jacek Błażewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger

   Pages 13-24

4. On the Minimum Size of a Contraction-Universal Tree

   • Olivier Bodini

   Pages 25-34

5. Optimal Area Algorithm for Planar Polyline Drawings

   • Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

   Pages 35-46

6. Cycles in Generalized Networks

   • Franz J. Brandenburg

   Pages 47-56

7. New Graph Classes of Bounded Clique-Width

   • Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca

   Pages 57-67

8. More about Subcolorings

   • Hajo Broersma, Fedor V. Fomin, Jaroslav Nešetřil, Gerhard J. Woeginger

   Pages 68-79

9. Search in Indecomposable Graphs

   • Alain Cournier

   Pages 80-91

10. On the Complexity of (k, l)-Graph Sandwich Problems

    • Simone Dantas, Celina M.H. de Figueiredo, Luerbio Faria

    Pages 92-101

11. Algorithms and Models for the On-Line Vertex-Covering

    • Marc Demange, Vangelis Th. Paschos

    Pages 102-113

12. Weighted Node Coloring: When Stable Sets Are Expensive

    • Marc Demange, D. de Werra, J. Monnot, Vangelis Th. Paschos

    Pages 114-125

13. The Complexity of Restrictive H-Coloring

    • Josep Díaz, Maria Serna, Dimitrios M. Thilikos

    Pages 126-137

14. A New 3-Color Criterion for Planar Graphs

    • Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski

    Pages 138-149

15. An Additive Stretched Routing Scheme for Chordal Graphs

    • Yon Dourisboure

    Pages 150-163

16. Complexity of Pattern Coloring of Cycle Systems

    • Zdeněk Dvořák, Jan Kára, Daniel Král', Ondřej Pangrác

    Pages 164-175

17. Safe Reduction Rules for Weighted Treewidth

    • Frank van den Eijkhof, Hans L. Bodlaender

    Pages 176-185

18. Graph Separator Algorithms: A Refined Analysis

    • Henning Fernau

    Pages 186-197

19. Generalized H-Coloring and H-Covering of Trees

    • Jiří Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle

    Pages 198-210

20. The Complexity of Approximating the Oriented Diameter of Chordal Graphs

    • Fedor V. Fomin, Martín Matamala, Ivan Rapaport

    Pages 211-222

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

• Algorithmic Graph Theory
• Approximation
• Computational Discrete Mathematics
• Computational Geometry
• Geometric Algorithms
• Graph
• Graph Algorithms
• Graph Coloring
• Graph Computations
• Graph Drawing
• Network Algorithms
• algorithms
• computer
• computer science
• algorithm analysis and problem complexity
• data structures

• Karlsruhe University, Germany

  Gerhard Goos

• Cornell University, NY, USA

  Juris Hartmanis

• Utrecht University, The Netherlands

  Jan Leeuwen

• Department of Applied Mathematics, Charles University, Prague, Czech Republic

  Luděk Kučera