32. WG 2006: Bergen, Norway
Fedor V. Fomin (Ed.): Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Springer 2006 Lecture Notes in Computer Science ISBN 3-540-48381-0- Hans L. Bodlaender: Treewidth: Characterizations, Applications, and Computations. 1-14
- 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
- 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
- Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz: How to Sell a Graph: Guidelines for Graph Retailers. 125-136
- 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
- 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 P4-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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team