| Invited Lecture: Silver Graphs: Achievements and New Challenges / Hartmut Noltemeier |
| Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts / Susanne Albers |
| Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and |
| Car Manufacturing Industries / Thomas Lengauer |
| Informatica, Scuola, Communita: Uno Sguardo dall' Occhio del Ciclone / N. Santoro |
| Proximity-Preserving Labeling Schemes and Their Applications / David Peleg |
| Euler is Standing in Line / D. Hauptmeier ; S. O. Krumke ; J. Rambau ; H.-C. Wirth |
| Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 / Sascha Ott |
| ComplexityClassification of Some Edge Modification Problems / Assaf Natanzon ; Ron Shamir ; Roded Sharan |
| On Minimum Diameter Spanning Trees under Reload Costs / Hans-Christoph Wirth ; Jan Steffan |
| Induced Matchings in Regular Graphs and Trees / Michele Zito |
| Mod-2 Independence and Domination in Graphs / Magnús M. Halldó rsson ; Jan Kratochvil ; Jan Arne Telle |
| On the Nature of Structure and Its Identification / Ojvind Johansson ; Benno Stein ; Oliver Niggemann |
| On the Clique-Width of Perfect Graph Classes / Martin Charles Golumbic ; Udi Rotics |
| An Improved Algorithm for Finding Tree Decompositions of Small Width / Ljubomir Perkovic ; Bruce Reed |
| Efficient Analysis of Graphs with Small Minimal Separators / K. Skodinis |
| Generating All the Minimal Separators of a Graph / Anne Berry ; Jean-Paul Bordat ; Olivier Cogis |
| Two Broadcasting Problems in FaultyHypercubes / Stefan Dobrev ; Imrich Vrto |
| Routing Permutations in the Hypercube / Olivier Baudon ; Guillaume Fertin ; Ivan Havel |
| An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs / Koichi Wada ; Yoriyuki Nagata ; Wei Chen |
| Optimal Irreversible Dynamos in Chordal Rings / Paola Flocchini ; Frédéric Geurts ; Nicola Santoro |
| Recognizing Bipartite Incident-Graphs of Circulant Digraphs / Johanne Cohen ; Pierre Fraigniaud ; Cyril Gavoille |
| Optimal Cuts for Powers of the Petersen Graph / Sergei L. Bezrukov ; Sajal K. Das ; Robert Elsässer |
| Dihamiltonian Decomposition of Regular Graphs with Degree Three / Jung-Heum Park ; Hee-Chul Kim |
| Box-Rectangular Drawings of Plane Graphs / Md. Saidur Rahman ; Shin-ichi Nakano ; Takao Nishizeki |
| A Multi-Scale Algorithm for Drawing Graphs Nicely / Ronny Hadany ; David Harel |
| All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time / Anna Accornero ; Massimo Ancona ; Sonia Varini |
| Linear Orderings of Random Geometric Graphs / Josep Diaz ; Mathew D. Penrose ; Jordi Petit ; Maria Serna |
| Finding Smallest Supertrees Under Minor Containment / Naomi Nishimura ; Prabhakar Ragde ; Dimitrios M. Thilikos |
| Vertex Cover: Further Observations and Further Improvements / Jianer Chen ; Iyad A. Kanj ; Weijia Jia |
| On the Hardness of Recognizing Bundles in Time Table Graphs / Annegret Liebers ; Dorothea Wagner ; Karsten Weihe |
| Optimal Solutions for FrequencyAssignment Problems via Tree Decomposition / Arie M.C.A. Koster ; Stan P.M. van Hoesel ; Antoon W.J. Kolen |
| Fixed-Parameter Complexity of ?-Labelings / Jiri Fiala ; Ton Kloks |
| Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs / Andreas Brandstädt ; Feodor F. Dragan ; Ekkehard Köhler |
| On Claw-Free Asteroidal Triple-Free Graphs / Harald Hempel ; Dieter Kratsch |
| Vertex Partitioning of Crown-Free Interval Graphs / Giuseppe Confessore ; Paolo Dell'Olmo ; Stefano Giordani |
| Author Index / I. Parfenoff ; F. Roussel ; I. Rusu |
| Invited Lecture: Silver Graphs: Achievements and New Challenges / Hartmut Noltemeier |
| Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts / Susanne Albers |
| Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and |
ＥＢ
