29. WG 2003:
Elspeet,
The Netherlands
Hans L. Bodlaender (Ed.):
Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers.
Lecture Notes in Computer Science 2880 Springer 2003, ISBN 3-540-20452-0 BibTeX
Invited Lectures
Regular Papers
- Claudio Arbib, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering.
23-33
Electronic Edition (link) BibTeX
- Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos:
Searching Is Not Jumping.
34-45
Electronic Edition (link) BibTeX
- Simon M. Becker, Bernhard Westfechtel:
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars.
46-57
Electronic Edition (link) BibTeX
- Anne Berry, Pinar Heggernes, Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process.
58-70
Electronic Edition (link) BibTeX
- Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Generalized Parametric Multi-terminal Flows Problem.
71-80
Electronic Edition (link) BibTeX
- Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.
81-92
Electronic Edition (link) BibTeX
- Paul S. Bonsma:
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.
93-105
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
106-118
Electronic Edition (link) BibTeX
- Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm.
119-130
Electronic Edition (link) BibTeX
- Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks.
131-142
Electronic Edition (link) BibTeX
- Paz Carmi, Thomas Erlebach, Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs.
143-155
Electronic Edition (link) BibTeX
- Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson:
Graph-Based Approaches to Software Watermarking.
156-167
Electronic Edition (link) BibTeX
- Sabine Cornelsen, Dorothea Wagner:
Completely Connected Clustered Graphs.
168-179
Electronic Edition (link) BibTeX
- Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting.
180-191
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve.
192-204
Electronic Edition (link) BibTeX
- Vida Dujmovic, David R. Wood:
Tree-Partitions of k-Trees with Applications in Graph Layout.
205-217
Electronic Edition (link) BibTeX
- Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks.
218-229
Electronic Edition (link) BibTeX
- Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto:
An Improved Upper Bound on the Crossing Number of the Hypercube.
230-236
Electronic Edition (link) BibTeX
- Alexander Glikson, Johann A. Makowsky:
NCE Graph Grammars and Clique-Width.
237-248
Electronic Edition (link) BibTeX
- Martin Charles Golumbic, Marina Lipshteyn:
Chordal Probe Graphs.
249-260
Electronic Edition (link) BibTeX
- Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
261-272
Electronic Edition (link) BibTeX
- Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller:
On the Recognition of General Partition Graphs.
273-283
Electronic Edition (link) BibTeX
- Lukasz Kowalik:
Short Cycles in Planar Graphs.
284-296
Electronic Edition (link) BibTeX
- Jan Kratochvíl:
Complexity of Hypergraph Coloring and Seidel's Switching.
297-308
Electronic Edition (link) BibTeX
- Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.
309-321
Electronic Edition (link) BibTeX
- Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions.
322-333
Electronic Edition (link) BibTeX
- Paul Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.
334-345
Electronic Edition (link) BibTeX
- Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem.
346-357
Electronic Edition (link) BibTeX
- Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs.
358-369
Electronic Edition (link) BibTeX
- Ioan Todinca:
Coloring Powers of Graphs of Bounded Clique-Width.
370-382
Electronic Edition (link) BibTeX
Erratum
Copyright © Sat May 16 23:47:49 2009
by Michael Ley (ley@uni-trier.de)
