Graph-Theoretic Concepts in Computer Science

1. Parameterized Complexity and Exponential Algorithms

   1. Finding k Disjoint Triangles in an Arbitrary Graph

      • Mike Fellows, Pinar Heggernes, Frances Rosamond, Christian Sloper, Jan Arne Telle

      Pages 235-244

   2. Exact (Exponential) Algorithms for the Dominating Set Problem

      • Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger

      Pages 245-256

   3. Linear Kernels in Linear Time, or How to Save k Colors in O(n ²) Steps

      • Benny Chor, Mike Fellows, David Juedes

      Pages 257-269

2. Counting, Combinatorics, and Optimization

   1. Planar Graphs, via Well-Orderly Maps and Trees

      • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer

      Pages 270-284

   2. Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs

      • Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight

      Pages 285-295

   3. Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters

      • Mordecai J. Golin, Yiu Cho Leung

      Pages 296-307

3. Applications (Biology, Graph Drawing)

   1. Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs

      • Zhi-Zhong Chen, Tatsuie Tsukiji

      Pages 308-319

   2. Octagonal Drawings of Plane Graphs with Prescribed Face Areas

      • Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki

      Pages 320-331

   3. Crossing Reduction in Circular Layouts

      • Michael Baur, Ulrik Brandes

      Pages 332-343

4. Graph Classes and NP Hardness

   1. Characterization and Recognition of Generalized Clique-Helly Graphs

      • Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter

      Pages 344-354

   2. Edge-Connectivity Augmentation and Network Matrices

      • Michele Conforti, Anna Galluccio, Guido Proietti

      Pages 355-364

   3. Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size

      • Takehiro Ito, Xiao Zhou, Takao Nishizeki

      Pages 365-376

   4. The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

      • Dominique de Werra, Marc Demange, Jerome Monnot, Vangelis Th. Paschos

      Pages 377-388

   5. Core Stability of Minimum Coloring Games

      • Thomas Bietenhader, Yoshio Okamoto

      Pages 389-401

5. Back Matter

   PDF

During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.

• Graph
• algorithms
• bioinformatics
• combinatorics
• complexity
• computer
• computer science
• optimization
• algorithm analysis and problem complexity
• data structures

• Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland

  Juraj Hromkovič

• Department of Computer Science, RWTH Aachen, Chair of Computer Science III, Aachen, Germany

  Manfred Nagl

• Department of Computer Science III, RWTH Aachen University, Aachen, Germany

  Bernhard Westfechtel

Policies and ethics