Abstract is missing.
- On Improved Time Bounds for Permutation Graph ProblemsAndreas Brandstädt. 1-10
- A Simple Test for Interval GraphsWen-Lian Hsu. 11-16
- Tolerance Graphs and OrdersStefan Felsner. 17-26
- On Scheduling Problems Restricted to Interval OrdersKlaus Jansen. 27-36
- Scheduling with Incompatible JobsHans Leo Bodlaender, Klaus Jansen, Gerhard J. Woeginger. 37-49
- Generalized Coloring for Tree-like GraphsKlaus Jansen, Petra Scheffler. 50-59
- Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph ClassesElias Dahlhaus. 60-69
- Topology of Parallel Networks and Computational Complexity (Extended Abstract)Juraj Hromkovic. 70-77
- Parallel Triangulation of Nonconvex PolytopesW. Preilowski. 78-89
- Kayles on Special Classes of Graphs - An Application of Sprague-Grundy TheoryHans Leo Bodlaender. 90-102
- A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average GenusJianer Chen. 103-113
- Improved Algorithms for Routing on Two-Dimensional GridsDinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton. 114-122
- Minimum Rectilinear Steiner Tree for Intervals on two Parallel LinesEdmund Ihler. 123-134
- A New Characterization of Tree Medians with Applications to Distributed AlgorithmsOrnan Ori Gerstel, Shmuel Zaks. 135-144
- The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a GraphYefim Dinitz. 145-157
- On Assembly of Four-Connected Graphs (Extended Abstract)Jianer Chen, Arkady Kanevsky. 158-169
- On the Homogeneous Decomposition of GraphsBeverly Jamison, Stephan Olariu. 170-183
- Embeddings in Recursive Combinatorial NetworksSajal K. Das, Aisheng Mao. 184-204
- On Shortcutting DigraphsMikkel Thorup. 205-211
- An Efficient Algorithm to Recognize Prime Undirected GraphsAlain Cournier, Michel Habib. 212-224
- On the Complexity of Partial Order PropertiesStefan Felsner, Dorothea Wagner. 225-235
- Probabilistic Graph GrammarsMohamed Mosbah. 236-247
- Single vs. Double Pushout Derivations of GraphsFrancesco Parisi-Presicce. 248-262
- Hexagonal Grid DrawingsGoos Kant. 263-276
- Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of ProgrammingMartin Erwig. 277-292
- Petri Nets, Hypergraphs and Conflicts (Preliminary Version)Paola Alimonti, Esteban Feuerstein. 293-309
- Analysis and Manipulation of Boolean Functions in Terms of Decision GraphsJordan Gergov, Christoph Meinel. 310-320
- The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and SilenceUna-May O Reilly, Nicola Santoro. 321-332
- The Power and the Limitations of Local Computations on GraphsIgor Litovsky, Yves Métivier, Wieslaw Zielonka. 333-345