33. WG 2007: Dornburg, Germany

• Petr A. Golovach, Jan Kratochvíl:
  Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. 1-11
  
• Arthur H. Busch, Garth Isaak:
  Recognizing Bipartite Tolerance Graphs in Linear Time. 12-20
  
• David Richerby, Dimitrios M. Thilikos:
  Graph Searching in a Crime Wave. 21-32
  
• Frédéric Mazoit, Nicolas Nisse:
  Monotonicity of Non-deterministic Graph Searching. 33-44
  
• Vadim V. Lozin, Martin Milanic:
  Tree-Width and Optimization in Bounded Degree Graphs. 45-54
  
• Philippe Gambette, Stéphane Vialette:
  On Restrictions of Balanced 2-Interval Graphs. 55-65
  
• Bruno Courcelle, Mamadou Moustapha Kanté:
  Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. 66-75
  
• Frank Gurski, Egon Wanke:
  The Clique-Width of Tree-Power and Leaf-Power Graphs. 76-85
  
• Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
  NLC-2 Graph Recognition and Isomorphism. 86-98
  
• Daniel Meister:
  A Characterisation of the Minimal Triangulations of Permutation Graphs. 99-108
  
• Maw-Shang Chang, Ming-Tat Ko:
  The 3-Steiner Root Problem. 109-120
  
• Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner:
  On Finding Graph Clusterings with Maximum Modularity. 121-132
  
• Fabrizio Frati:
  On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. 133-144
  
• Torben Hagerup:
  A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. 145-150
  
• Klaus Jansen:
  Approximation Algorithms for Geometric Intersection Graphs. 151-153
  
• Angelo Monti, Paolo Penna, Riccardo Silvestri:
  An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. 154-165
  
• Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
  Mixing 3-Colourings in Bipartite Graphs. 166-177
  
• Bodo Manthey:
  Minimum-Weight Cycle Covers and Their Approximability. 178-189
  
• Stefan Felsner, Florian Zickfeld:
  On the Number of alpha -Orientations. 190-201
  
• Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
  Complexity and Approximation Results for the Connected Vertex Cover Problem. 202-213
  
• Peter Damaschke:
  Segmenting Strings Homogeneously Via Trees. 214-225
  
• Van Bang Le, H. N. de Ridder:
  Characterisations and Linear-Time Recognition of Probe Cographs. 226-237
  
• Martin Pergel:
  Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. 238-247
  
• Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
  Proper Helly Circular-Arc Graphs. 248-257
  
• Karol Suchan, Ioan Todinca:
  Pathwidth of Circular-Arc Graphs. 258-269
  
• Daniel Meister, Jan Arne Telle, Martin Vatshelle:
  Characterization and Recognition of Digraphs of Bounded Kelly-width. 270-279
  
• Frederic Dorn:
  How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. 280-291
  
• Dániel Marx, Ildikó Schlotter:
  Obtaining a Planar Graph by Vertex Deletion. 292-303
  
• Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
  Mixed Search Number and Linear-Width of Interval and Split Graphs. 304-315
  
• Matthias Hagen:
  Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. 316-327
  
• Refael Hassin, Jérôme Monnot, Danny Segev:
  The Complexity of Bottleneck Labeled Graph Problems. 328-340