Abstract is missing.
- Approximating Treewidth, Pathwidth, and Minimum Elimination Tree HeightHans Leo Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson. 1-12
- Monadic Second-Order Evaluations on Tree-Decomposable GraphsBruno Courcelle, Mohamed Mosbah. 13-24
- Optimal Embedding of Complete Binary Trees into Lines and GridsRalf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger. 25-35
- Graph Rewriting Systems and their Application to Network Reliability AnalysisYasuyoshi Okada, Masahiro Hayashi. 36-47
- Nondeterministic Control Structures for Graph Rewriting SystemsAlbert Zündorf, Andy Schürr. 48-62
- A Language for Generic Graph-TransformationsMarc Andries, Jan Paredaens. 63-74
- Attributed Elementarz Programmed Graph GrammarsRudolf Freund, Brigitte Haberstroh. 75-84
- The Complexity of Approximating the Class Steiner Tree ProblemEdmund Ihler. 85-96
- On Complexity of Some Chain and Antichain Partition ProblemsZbigniew Lonc. 97-104
- Tight Bounds for the Rectangualr Art Gallery ProblemJurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks. 105-112
- Voronoi Diagrams of Moving Points in the PlaneLeonidas J. Guibas, Joseph S. B. Mitchell. 113-125
- Using Maximal Independent Sets to Solve Problems in ParallelTakayoshi Shoudai. 126-134
- Fast Parallel Algorithms for Coloring Random GraphsZvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. 135-147
- Optimal Vertex Ordering of a Graph and its Application to Symmetry DetectionXiaoyi Jiang, Horst Bunke. 148-158
- Edge Separators for Graphs of Bounded Genus with ApplicationsOndrej Sýkora, Imrich Vrto. 159-168
- Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and RoutingDing-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu. 169-179
- A Generalized Encryption Scheme Based on Random GraphsLudek Kucera. 180-186
- Dynamic Algorithms for Shortest Paths in Planar GraphsEsteban Feuerstein, Alberto Marchetti-Spaccamela. 187-197
- Copmlete Problems for Logspace Involving Lexicographic First Paths in GraphsIain A. Stewart. 198-208
- A New Upper Bound on the Complexity of the All Pairs Shortest Path ProblemTadao Takaoka. 209-213
- On the Crossing Number of the Hypercube and the Cube Connected CyclesOndrej Sýkora, Imrich Vrto. 214-218
- Logic Arrays for Interval Indicator FunctionsPeter Damaschke. 219-225
- On the Broadcast Time of the Butterfly networkElena Stöhr. 226-229
- On Disjoint CyclesHans Leo Bodlaender. 230-238
- Short Disjoint Cycles in Cubic Bridgeless GraphsAndreas Brandstädt. 239-249