| Invited Lecture |
| Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows |
| Matching, Edge-Colouring, and Dimers / Alexander Schrijver |
| Regular Papers |
| Minimum Flow Time Graph Ordering / Claudio Arbib ; Michele Flammini ; Fabrizio Marinelli |
| Searching Is Not Jumping / Lali Barrière ; Pierre Fraigniaud ; Nicola Santoro ; Dimitrios M. Thilikos |
| Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars / Simon M. Becker ; Bernhard Westfechtel |
| The Minimum Degree Heuristic and the Minimal Triangulation Process / Anne Berry ; Pinar Heggernes ; Geneviève Simonet |
| Generalized Parametric Multi-terminal Flows Problem / Pascal Berthomé ; Madiagne Diallo ; Afonso Ferreira |
| Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation / Nicolas Bonichon ; Cyril Gavoille ; Nicolas Hanusse |
| The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes / Paul Bonsma |
| Tree Spanners for Bipartite Graphs and Probe Interval Graphs / Andreas Brandstädt ; Feodor F. Dragan ; Hoang-Oanh Le ; Van Bang Le ; Ryuhei Uehara |
| A Simple Linear Time LexBFS Cograph Recognition Algorithm / Anna Bretscher ; Derek Corneil ; Michel Habib ; Christophe Paul |
| Backbone Colorings for Networks / Hajo Broersma ; Fedor V. Fomin ; Petr A. Golovach ; Gerhard J. Woeginger |
| Greedy Edge-Disjoint Paths in Complete Graphs / Paz Carmi ; Thomas Erlebach ; Yoshio Okamoto |
| Graph-Based Approaches to Software Watermarking / Christian Collberg ; Stephen Kobourov ; Edward Carter ; Clark Thomborson |
| Completely Connected Clustered Graphs / Sabine Cornelsen ; Dorothea Wagner |
| An FPT Algorithm for Set Splitting / Frank Dehne ; Frances A. Rosamond |
| Drawing Planar Graphs on a Curve / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Stephen K. Wismath |
| Tree-Partitions of k-Trees with Applications in Graph Layout / Vida Dujmovic ; David R. Wood |
| Resource Allocation Problems in Multifiber WDM Tree Networks / Aris Pagourtzis ; Katerina Potika ; Stamatis Stefanakos |
| An Improved Upper Bound on the Crossing Number of the Hypercube / Luerbio Faria ; Celina M. Herrera de Figueiredo ; Ondrej Sýkora ; Imrich Vrt'o |
| NCE GraphGrammarsandClique-Width / Alexander Glikson ; Johann A. Makowsky |
| Chordal Probe Graphs / Martin Charles Golumbic ; Marina Lipshteyn |
| Subgraph Induced Planar Connectivity Augmentation / Carsten Gutwenger ; Michael Jünger ; Sebastian Leipert ; Petra Mutzel ; Merijam Percan ; René Weiskircher |
| On the Recognition of General Partition Graphs / Ton Kloks ; C.M. Lee ; Jiping Liu ; Haiko Müller |
| Short Cycles in Planar Graphs / Lukasz Kowalik |
| Complexity of Hypergraph Coloring and Seidel's Switching / Jan Kratochvil |
| Feedback Vertex Set and Longest Induced Path on AT-Free Graphs / Dieter Kratsch ; Ioan Todinca |
| The Complexity of Graph Contractions / Asaf Levin ; Daniël Paulusma |
| Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs / Paul Manuel ; Bharati Rajan ; Indra Rajasingh ; Amutha Alaguvel |
| The Probabilistic Minimum Coloring Problem / Cecile Murat ; Vangelis Th. Paschos |
| Recognizing Bipolarizable and P4-Simplicial Graphs / Stavros D. Nikolopoulos ; Leonidas Palios |
| Coloring Powers of Graphs of Bounded Clique-Width |
| Erratum |
| Erratum: Cycles in Generalized Networks / Franz J. Brandenburg |
| Author Index |
| Invited Lecture |
| Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows |
| Matching, Edge-Colouring, and Dimers / Alexander Schrijver |
図書
