Abstract is missing.
- Disjoint Paths in the HypercubeSeshu Madhavapeddy, Ivan Hal Sudborough. 3-18
- Time Bound for Broadcasting in Bounded Degree GraphsRenato M. Capocelli, Luisa Gargano, Ugo Vaccaro. 19-33
- t/s-Diagnosable Systems: A Characterization and Diagnosis AlgorithmAnindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan. 34-45
- Toward a Complete Representation of Graphoids in Graphs (Abridged Version)Robert Y. Geva, Azaria Paz. 46-62
- CADULA - A Graph-Based Model for Monitoring CAD-ProcessesDetlev Ruland. 63-72
- On Hyperedge Replacement and BNLC Graph GrammarsWalter Vogler. 78-93
- Graph Rewriting Systems with PrioritiesMichel Billaud, Pierre Lafon, Yves Métivier, Eric Sopena. 94-106
- Filtering Hyperedge-Replacement Through Compatible PropertiesAnnegret Habel, Hans-Jörg Kreowski. 107-120
- Describing Distributed Systems by Categorical Graph GrammarsHans Jürgen Schneider. 121-135
- A Parser for Context Free Plex GrammarsHorst Bunke, B. Haller. 136-150
- Introduction to PROGRESS, an Attribute Graph Grammar Based Specification LanguageAndy Schürr. 151-165
- On the Complexity of Optimal Drawings of GraphsFranz-Josef Brandenburg. 166-180
- Bounds to the Page Number of Partially Ordered SetsMaciej M. Syslo. 181-195
- Beyond Steiner s Problem: A VLSI Oriented GeneralizationGabriele Reich, Peter Widmayer. 196-210
- A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a GraphIngo Schiermeyer. 211-217
- On Feedback Problems in DiagraphsEwald Speckenmeyer. 218-231
- Improved Self-Reduction Algorithms for Graphs with Bounded TreewidthHans Leo Bodlaender. 232-244
- Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear TimeKlaus Simon. 245-259
- Paging Binary Trees with External BalancingAndreas Henrich, Hans-Werner Six, Peter Widmayer. 260-276
- The Complexity of Graph Problems fore Succinctly Represented GraphsAntoni Lozano, José L. Balcázar. 277-286
- An ::::O::::(::::n:::: log ::::n::::) Algorithm for 1-D Tile CompactionRichard Anderson, Simon Kahan, Martine D. F. Schlag. 287-301
- WEighted Parallel Triangulation of Simple PolygonsKnuth Menzel, Burkhard Monien. 302-315
- Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational GeometryFrank K. H. A. Dehne, Andrew Rau-Chaplin. 316-329
- k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and PointsThomas Roos. 330-340
- Finding Squares and Rectangles in Sets of PointsMarc J. van Kreveld, Mark de Berg. 341-355
- Combinatorial Properties of Abstract Voronoi DiagramsRolf Klein. 356-369