ISBN: 3-540-66731-8
TITLE: Graph-Theoretic Concepts in Computer Science
AUTHOR: Widmayer, Peter; Neyer, Gabriele; Eidenbenz, Stephan (Eds.)
TOC:

Invited Lecture: Silver Graphs: Achievements and New Challenges 1
Hartmut Noltemeier 

Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts 10
Susanne Albers
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries 27
Thomas Lengauer
Informatica, Scuola, Communit: Uno Sguardo dall' Occhio del Ciclone 29
N. Santoro
Proximity-Preserving Labeling Schemes and Their Applications 30
David Peleg
Euler is Standing in Line 42
D. Hauptmeier, S. O. Krumke, J. Rambau and H.-C. Wirth
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 55
Sascha Ott
Complexity Classification of Some Edge Modification Problems 65
Assaf Natanzon, Ron Shamir and Roded Sharan
On Minimum Diameter Spanning Trees under Reload Costs 78
Hans-Christoph Wirth and Jan Steffan
Induced Matchings in Regular Graphs and Trees 89
Michele Zito
Mod-2 Independence and Domination in Graphs 101
Magns M. Halldrsson, Jan Kratochvl and Jan Arne Telle
NLC_2-Decomposition in Polynomial Time 110
jvind Johansson
On the Nature of Structure and Its Identification 122
Benno Stein and Oliver Niggemann
On the CliqueWidth of Perfect Graph Classes 135
Martin Charles Golumbic and Udi Rotics
An Improved Algorithm for Finding Tree Decompositions of Small Width 148
Ljubomir Perkovic and Bruce Reed
Efficient Analysis of Graphs with Small Minimal Separators 155
K. Skodinis
Generating All the Minimal Separators of a Graph 167
Anne Berry, Jean-Paul Bordat and Olivier Cogis
Two Broadcasting Problems in Faulty Hypercubes 173
Stefan Dobrev and Imrich Vrto Routing Permutations in the Hypercube 179
Olivier Baudon, Guillaume Fertin and Ivan Havel
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs 191
Koichi Wada, Yoriyuki Nagata and Wei Chen
Optimal Irreversible Dynamos in Chordal Rings 202
Paola Flocchini, Frdric Geurts and Nicola Santoro
Recognizing Bipartite Incident-Graphs of Circulant Digraphs 215
Johanne Cohen, Pierre Fraigniaud and Cyril Gavoille
Optimal Cuts for Powers of the Petersen Graph 228
Sergei L. Bezrukov, Sajal K. Das and Robert Elssser
Dihamiltonian Decomposition of Regular Graphs with Degree Three 240
Jung-Heum Park and Hee-Chul Kim
Box-Rectangular Drawings of Plane Graphs 250
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
A Multi-Scale Algorithm for Drawing Graphs Nicely 262
Ronny Hadany and David Harel
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time 278
Anna Accornero, Massimo Ancona and Sonia Varini
Linear Orderings of Random Geometric Graphs 291
Josep Daz, Mathew D. Penrose, Jordi Petit and Mara Serna
Finding Smallest Supertrees Under Minor Containment 303
Naomi Nishimura, Prabhakar Ragde and Dimitrios M. Thilikos
Vertex Cover: Further Observations and Further Improvements 313
Jianer Chen, Iyad A. Kanj and Weijia Jia
On the Hardness of Recognizing Bundles in Time Table Graphs 325
Annegret Liebers, Dorothea Wagner and Karsten Weihe
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition 338
Arie M.C.A. Koster, Stan P.M. van Hoesel and Antoon W.J. Kolen
Fixed-Parameter Complexity of lambda-Labelings 350
Jir Fiala, Ton Kloks and Jan Kratochvl
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)Free Graphs 364
Andreas Brandstdt, Feodor F. Dragan and Ekkehard Khler
On Claw-Free Asteroidal Triple-Free Graphs 377
Harald Hempel and Dieter Kratsch
Vertex Partitioning of Crown-Free Interval Graphs 391
Giuseppe Confessore, Paolo Dell'Olmo and Stefano Giordani Triangulated Neighbourhoods in C_4-Free Berge Graphs 402
I. Parfenoff, F. Roussel and I. Rusu
Author Index 413
END
