34. WG 2008:
Durham, UK
Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma (Eds.):
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers.
Lecture Notes in Computer Science 5344 2008, ISBN 978-3-540-92247-6 
Invited Contributions
Regular Papers
- Ilya Averbouch, Benny Godlin, Johann A. Makowsky:
A Most General Edge Elimination Polynomial.
31-42
- Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time.
43-54
- Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The Valve Location Problem in Simple Network Topologies.
55-65
- Paul S. Bonsma, Florian Zickfeld:
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
66-77
- Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Pseudo-achromatic Number Problem.
78-89
- Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca:
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
90-100
- Marek Cygan, Marcin Pilipczuk:
Faster Exact Bandwidth.
101-109
- Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang:
Additive Spanners for Circle Graphs and Polygonal Graphs.
110-121
- Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov:
Upward Straight-Line Embeddings of Directed Graphs into Point Sets.
122-133
- Jirí Fiala, Petr A. Golovach:
Complexity of the Packing Coloring Problem for Trees.
134-145
- J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges.
146-158
- Fabrizio Frati:
A Lower Bound on the Area Requirements of Series-Parallel Graphs.
159-170
- Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs.
171-182
- Benny Godlin, Tomer Kotek, Johann A. Makowsky:
Evaluations of Graph Polynomials.
183-194
- Petr A. Golovach, Yngve Villanger:
Parameterized Complexity for Domination Problems on Degenerate Graphs.
195-205
- Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo:
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.
206-217
- Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
218-229
- Vít Jelínek:
The Rank-Width of the Square Grid.
230-239
- Joachim Kneis, Alexander Langer, Peter Rossmanith:
Improved Upper Bounds for Partial Vertex Cover.
240-251
- Pascal Koiran, Klaus Meer:
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.
252-263
- Athanassios Koutsonas, Dimitrios M. Thilikos:
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.
264-274
- Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?.
275-286
- Dániel Marx, Ildikó Schlotter:
Parameterized Graph Cleaning Problems.
287-299
- Xavier Muñoz, Ignasi Sau:
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph.
300-311
- Nicolas Nisse, Karol Suchan:
Fast Robber in Planar Graphs.
312-323
- Yahav Nussbaum:
From a Circular-Arc Model to a Proper Circular-Arc Model.
324-335
- Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching.
336-347
- David Richerby, Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive.
348-359
- Siamak Tazari, Matthias Müller-Hannemann:
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.
360-371
- Andreas Wiese, Evangelos Kranakis:
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
372-383
Last update Fri May 17 16:27:22 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
