31. WG 2005:
Metz,
France
Dieter Kratsch (Ed.):
Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers.
Lecture Notes in Computer Science 3787 Springer 2005, ISBN 3-540-31000-2 BibTeX
Invited Lectures
Regular Papers
- Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun:
Domination Search on Graphs with Low Dominating-Target-Number.
28-37
Electronic Edition (link) BibTeX
- Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.
38-48
Electronic Edition (link) BibTeX
- Sang-il Oum:
Approximating Rank-Width and Clique-Width Quickly.
49-58
Electronic Edition (link) BibTeX
- Omer Giménez, Petr Hlinený, Marc Noy:
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
59-68
Electronic Edition (link) BibTeX
- Frank Gurski, Egon Wanke:
Minimizing NLC-Width is NP-Complete.
69-80
Electronic Edition (link) BibTeX
- Frédéric Havet, Jean-Sébastien Sereni:
Channel Assignment and Improper Choosability of Graphs.
81-90
Electronic Edition (link) BibTeX
- Daniel Meister:
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.
91-102
Electronic Edition (link) BibTeX
- Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Roman Domination over Some Graph Classes.
103-114
Electronic Edition (link) BibTeX
- Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.
115-126
Electronic Edition (link) BibTeX
- Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification.
127-138
Electronic Edition (link) BibTeX
- Emeric Gioan:
Complete Graph Drawings Up to Triangle Mutations.
139-150
Electronic Edition (link) BibTeX
- Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan:
Collective Tree 1-Spanners for Interval Graphs.
151-162
Electronic Edition (link) BibTeX
- Van Bang Le, Raffaele Mosca, Haiko Müller:
On Stable Cutsets in Claw-Free Graphs and Planar Graphs.
163-174
Electronic Edition (link) BibTeX
- Prosenjit Bose, Vida Dujmovic, David R. Wood:
Induced Subgraphs of Bounded Degree and Bounded Treewidth.
175-186
Electronic Edition (link) BibTeX
- Pinar Heggernes, Daniel Lokshtanov:
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.
187-198
Electronic Edition (link) BibTeX
- Anne Berry, Richard Krueger, Geneviève Simonet:
Ultimate Generalizations of LexBFS and LEX M.
199-213
Electronic Edition (link) BibTeX
- Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a Cograph.
214-226
Electronic Edition (link) BibTeX
- Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel:
The Computational Complexity of Delay Management.
227-238
Electronic Edition (link) BibTeX
- Daniel Gonçalves, Mickaël Montassier:
Acyclic Choosability of Graphs with Small Maximum Degree.
239-248
Electronic Edition (link) BibTeX
- Shin-Ichi Nakano, Takeaki Uno:
Generating Colored Trees.
249-260
Electronic Edition (link) BibTeX
- Ephraim Korach, Margarita Razgon:
Optimal Hypergraph Tree-Realization.
261-270
Electronic Edition (link) BibTeX
- Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.
271-282
Electronic Edition (link) BibTeX
- Peter Damaschke:
On the Fixed-Parameter Enumerability of Cluster Editing.
283-294
Electronic Edition (link) BibTeX
- Manuel Bodirsky, Daniel Král:
Locally Consistent Constraint Satisfaction Problems with Binary Constraints.
295-306
Electronic Edition (link) BibTeX
- Robert Elsässer, Thomas Sauerwald:
On Randomized Broadcasting in Star Graphs.
307-318
Electronic Edition (link) BibTeX
- Torsten Tholey:
Finding Disjoint Paths on Directed Acyclic Graphs.
319-330
Electronic Edition (link) BibTeX
- Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.
331-340
Electronic Edition (link) BibTeX
- Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson:
Approximation Algorithms for the Weighted Independent Set Problem.
341-350
Electronic Edition (link) BibTeX
- Erik Jan van Leeuwen:
Approximation Algorithms for Unit Disk Graphs.
351-361
Electronic Edition (link) BibTeX
- Pascal Berthomé, Sylvain Lebresne, Kim Nguyen:
Computation of Chromatic Polynomials Using Triangulations and Clique Trees.
362-373
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks.
374-384
Electronic Edition (link) BibTeX
- Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Algorithms Based on the Treewidth of Sparse Graphs.
385-396
Electronic Edition (link) BibTeX
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers.
397-408
Electronic Edition (link) BibTeX
- Joachim Giesen, Dieter Mitsche:
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.
409-420
Electronic Edition (link) BibTeX
- Ross M. McConnell, Fabien de Montgolfier:
Algebraic Operations on PQ Trees and Modular Decomposition Trees.
421-432
Electronic Edition (link) BibTeX
- Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
433-444
Electronic Edition (link) BibTeX
- Anne Berry, Alain Sigayret, Jeremy Spinrad:
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.
445-455
Electronic Edition (link) BibTeX
- Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHDS-Free Graphs.
456-467
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:50 2009
by Michael Ley (ley@uni-trier.de)
