Abstract is missing.
- Invited Lecture: Silver Graphs: Achievements and New ChallengesHartmut Noltemeier. 1-9 [doi]
- Invited Lecture: Online Algorithms: A Study of Graph-Theoretic ConceptsSusanne Albers. 10-26 [doi]
- Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing IndustriesThomas Lengauer. 27-28 [doi]
- Informatica, Scoula, Communità: Uno Sguardo dall Occhio del CicloneNicola Santoro. 29
- Proximity-Preserving Labeling Schemes and Their ApplicationsDavid Peleg. 30-41 [doi]
- Euler is Standing in LineDietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth. 42-54 [doi]
- Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2Sascha Ott. 55-64 [doi]
- Complexity Classification of Some Edge Modification ProblemsAssaf Natanzon, Ron Shamir, Roded Sharan. 65-77 [doi]
- On Minimum Diameter Spanning Trees under Reload CostsHans-Christoph Wirth, Jan Steffan. 78-88 [doi]
- Induced Matchings in Regular Graphs and TreesMichele Zito. 89-100 [doi]
- Mod-2 Independence and Domination in GraphsMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. 101-109 [doi]
- NLC::2::-Decomposition in Polynomial TimeÖjvind Johansson. 110-121 [doi]
- On the Nature of Structure and Its IdentificationBenno Stein, Oliver Niggemann. 122-134 [doi]
- On the Clique-Width of Perfect Graph ClassesMartin Charles Golumbic, Udi Rotics. 135-147 [doi]
- An Improved Algorithm for Finding Tree Decompositions of Small WidthLjubomir Perkovic, Bruce A. Reed. 148-154 [doi]
- Efficient Analysis of Graphs with Small Minimal SeparatorsKonstantin Skodinis. 155-166 [doi]
- Generating All the Minimal Separators of a GraphAnne Berry, Jean Paul Bordat, Olivier Cogis. 167-172 [doi]
- Two Broadcasting Problems in Faulty HypercubesStefan Dobrev, Imrich Vrto. 173-178 [doi]
- Routing Permutations in the HypercubeOlivier Baudon, Guillaume Fertin, Ivan Havel. 179-190 [doi]
- An Optimal Fault-Tolerant Routing for Triconnected Planar GraphsKoichi Wada, Yoriyuki Nagata, Wei Chen. 191-201 [doi]
- Optimal Irreversible Dynamos in Chordal RingsPaola Flocchini, Frédéric Geurts, Nicola Santoro. 202-214 [doi]
- Recognizing Bipartite Incident-Graphs of Circulant DigraphsJohanne Cohen, Pierre Fraigniaud, Cyril Gavoille. 215-227 [doi]
- Optimal Cuts for Powers of the Petersen GraphSergei L. Bezrukov, Sajal K. Das, Robert Elsässer. 228-239 [doi]
- Dihamiltonian Decomposition of Regular Graphs with Degree ThreeJung-Heum Park, Hee-Chul Kim. 240-249 [doi]
- Box-Rectangular Drawings of Plane GraphsMd. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki. 250-261 [doi]
- A Multi-Scale Algorithm for Drawing Graphs NicelyRonny Hadany, David Harel. 262-277 [doi]
- All Separating Triangles in a Plane Graph Can Be Optimally Broken in Polynomial TimeAnna Accornero, Massimo Ancona, Sonia Varini. 278-290 [doi]
- Linear Orderings of Random Geometric GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. 291-302 [doi]
- Finding Smallest Supertrees Under Minor ContainmentNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. 303-312 [doi]
- Vertex Cover: Further Observations and Further ImprovementsJianer Chen, Iyad A. Kanj, Weijia Jia. 313-324 [doi]
- On the Hardness of Recognizing Bundles in Time Table GraphsAnnegret Liebers, Dorothea Wagner, Karsten Weihe. 325-337 [doi]
- Optimal Solutions for Frequency Assignment Problems via Tree DecompositionArie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen. 338-349 [doi]
- Fixed-Parameter Complexity of lambda-LabelingsJirí Fiala, Ton Kloks, Jan Kratochvíl. 350-363 [doi]
- Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free GraphsAndreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler. 364-376 [doi]
- On Claw-Free Asteroidal Triple-Free GraphsHarald Hempel, Dieter Kratsch. 377-390 [doi]
- Vertex Partitioning of Crown-Free Interval GraphsGiuseppe Confessore, Paolo Dell Olmo, Stefano Giordani. 391-401 [doi]
- Triangulated Neighbourhoods in ::::C::::::4::-Free Berge GraphsIgor Parfenoff, Florian Roussel, Irena Rusu. 402-412 [doi]