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