32. WG 2006: Bergen, Norway

• Hans L. Bodlaender:
  Treewidth: Characterizations, Applications, and Computations. 1-14
  
• Jirí Fiala, Jan Kratochvíl:
  Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. 15-26
  
• Jan Foniok, Jaroslav Nesetril, Claude Tardif:
  Generalised Dualities and Finite Maximal Antichains. 27-36
  
• Dániel Marx:
  Chordal Deletion Is Fixed-Parameter Tractable. 37-48
  
• Christian Knauer, Andreas Spillner:
  A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. 49-57
  
• Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
  Divide-and-Color. 58-67
  
• Masashi Kiyomi, Shuji Kijima, Takeaki Uno:
  Listing Chordal Graphs and Interval Graphs. 68-77
  
• Serge Gaspers, Mathieu Liedloff:
  A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. 78-89
  
• Lukasz Kowalik:
  Improved Edge-Coloring with Three Colors. 90-101
  
• Yasuhiko Takenaga, Kenichi Higashide:
  Vertex Coloring of Comparability+ke and -ke Graphs. 102-112
  
• Seok-Hee Hong, Hiroshi Nagamochi:
  Convex Drawings of Graphs with Non-convex Boundary. 113-124
  
• Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
  How to Sell a Graph: Guidelines for Graph Retailers. 125-136
  
• Magnús M. Halldórsson, Ragnar K. Karlsson:
  Strip Graphs: Recognition and Scheduling. 137-146
  
• Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
  Approximating the Traffic Grooming Problem in Tree and Star Networks. 147-158
  
• Gaurav Goel, Jens Gustedt:
  Bounded Arboricity to Determine the Local Structure of Sparse Graphs. 159-167
  
• Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott Lundberg, Ross M. McConnell:
  An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. 168-178
  
• David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
  Partitioned Probe Comparability Graphs. 179-190
  
• Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin:
  Computing Graph Polynomials on Graphs of Bounded Clique-Width. 191-204
  
• Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
  Generation of Graphs with Bounded Branchwidth. 205-216
  
• Ivan Rapaport, Karol Suchan, Ioan Todinca:
  Minimal Proper Interval Completions. 217-228
  
• Pierre Fraigniaud, Nicolas Nisse:
  Monotony Properties of Connected Visible Graph Searching. 229-240
  
• Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
  Finding Intersection Models of Weakly Chordal Graphs. 241-255
  
• Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
  A Fully Dynamic Algorithm for the Recognition of P₄-Sparse Graphs. 256-268
  
• Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez:
  Clique Graph Recognition Is NP-Complete. 269-277
  
• Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
  Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. 278-288
  
• Haim Kaplan, Yahav Nussbaum:
  Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. 289-300
  
• Jérémie Chalopin, Daniël Paulusma:
  Graph Labelings Derived from Models in Distributed Computing. 301-312
  
• Miklós Bartha, Miklós Krész:
  Flexible Matchings. 313-324
  
• Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
  Simultaneous Graph Embeddings with Fixed Edges. 325-335
  
• Bodo Manthey:
  Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. 336-347
  
• Sylvain Coulonges:
  Circular-Perfect Concave-Round Graphs. 348-355
  

Last update Wed Feb 15 05:21:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page