Abstract is missing.
- VC-Dimensions for Graphs (Extended Abstract)Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger. 1-13
- Finding and Counting Small Induced Subgraphs EfficientlyTon Kloks, Dieter Kratsch, Haiko Müller. 14-23
- On the Isomorphism of Graphs with Few P4sLuitpold Babel, Stephan Olariu. 24-36
- A Dynamic Algorithm for Line Graph RecognitionDaniele Giorgio Degiorgi, Klaus Simon. 37-48
- Incremental Hive GraphFabrizio d Amore, Roberto Giaccio. 49-61
- Planarization of Graphs Embedded on SurfacesHristo Djidjev, Shankar M. Venkatesan. 62-72
- Complexity and Approximability of Certain Bicriteria Location ProblemsSven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe. 73-87
- On Termination of Graph RewritingDetlef Plump. 88-100
- A Uniform Approach to Graph Rewriting: The Pullback ApproachMichel Bauderon. 101-115
- Visualizing Two- and Three-Dimensional Models of Meristematic GrowthF. David Fracchia. 116-130
- Graph-Theoretical Methods to Construct Entity-Relationship DatabasesSven Hartmann. 131-145
- An Approximation Algorithm for 3-ColourabilityIngo Schiermeyer. 146-151
- The Malleability of TSP_{2Opt}Sophie Fischer, Leen Torenvliet. 152-166
- Non-Oblivious Local Search for Grpah and Hyperpraph Coloring ProblemsPaola Alimonti. 167-180
- On Interval Routing Schemes and TreewidthHans Leo Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen. 181-196
- Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube GraphsKoichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen. 197-208
- Hot-Potato Routing on Multi-Dimensional ToriFriedhelm Meyer auf der Heide, Matthias Westermann. 209-221
- On Devising Boolean Routing SchemesMichele Flammini, Giorgio Gambosi, Sandro Salomone. 222-236
- Toward a General Theory of Unicast-Based Multicast CommunicationBarbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng. 237-251
- Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional MeshesJosé D. P. Rolim, Ondrej Sýkora, Imrich Vrto. 252-264
- Searching for Faulty Leaves in Binary TreesPeter Damaschke. 265-274
- NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard ProblemsZhi-Zhong Chen, Xin He. 275-289
- Efficient Parallel Modular Decomposition (Extended Abstract)Elias Dahlhaus. 290-302
- Modular Decomposition of HypergraphsPaola Bonizzoni, Gianluca Della Vedova. 303-317
- Partition Coefficients of Acyclic GraphsJohn L. Pfaltz. 318-322
- Sub-Cubic Cost Algorithms for the All Pairs Shortest Path ProblemTadao Takaoka. 323-343
- Diametral Path GraphsJitender S. Deogun, Dieter Kratsch. 344-357
- Chordal Graphs and Their Clique GraphsPhilippe Galinier, Michel Habib, Christophe Paul. 358-371
- A Compact Data Structure and Parallel Algorithms for Permutation GraphsJens Gustedt, Michel Morvan, Laurent Viennot. 372-380
- Homogeneously Orderable Graphs and the Steiner Tree ProblemAndreas Brandstädt, Feodor F. Dragan, Falk Nicolai. 381-395