Abstract is missing.
- NC-Algorithms for Graphs with Small TreewidthHans Leo Bodlaender. 1-10
- Graph-Theoretic Properties Compatible with Graph DerivationsAnnegret Habel. 11-29
- The Monadic Second-Order Logic of Graphs: Definable Sets of Finite GraphsBruno Courcelle. 30-53
- On Systems of Equations Defining Infinite GraphsMichel Bauderon. 54-73
- Fault Tolerant Networks of Specified DiameterHenk Meijer, R. Dawes. 74-86
- DFS Tree Construction: Algorithms and CharacterizationsEphraim Korach, Zvi Ostfeld. 87-106
- Serializable GraphsK. Vidyasankar. 107-121
- Transitive Closure Algorithms for Very Large DatabasesJoachim Biskup, Holger Stiefeling. 122-147
- A Graph-Based Decomposition Approach for Recursive Query ProcessingDietmar Seipel. 148-165
- Construction of Deterministic Transition Graphs from Dynamic Integrity ConstraintsUdo W. Lipeck, Dasu Feng. 166-179
- (Time × Space)-Efficient Implementations of Hierarchical Conceptual ModelsNicola Santoro. 180-189
- Dominance in the Presence of ObstraclesMark de Berg, Mark H. Overmars. 190-201
- Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract)Otto Nurmi, Jörg-Rüdiger Sack. 202-212
- Linear Time Algorithms for Testing Approximate Congruence in the PlaneSebastian Iwanowski. 213-228
- Moving Regular k-Gons in ContactStephan Abramowski, Bruno Lang, Heinrich Müller. 229-242
- Epsilon-Nets for HalfplanesGerhard J. Woeginger. 243-252
- Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract)Andrzej Lingas. 253-261
- A Simple Systolic Method to Find all Bridges of an Undirected GraphManfred Schimmler, Heiko Schröder. 262-267
- Colouring Perfect Planar Graphs in ParallelIain A. Stewart. 268-275
- An Efficient Parallel Algorithm for the All Pairs Shortest Path ProblemTadao Takaoka. 276-287
- A Parallel Algorithm for Channel RoutingJohn E. Savage, Markus G. Wloka. 288-303
- Application of Graph Theory to Topology Generation for Logic GatesHubert Kaeslin. 304-316
- On the Estimate of a Directed GraphAlberto Marchetti-Spaccamela. 317-326
- The Average Size of Ordered Binary SubgraphsPieter H. Hartel. 327-351
- O(n²) Algorithms for Graph PlanarizationR. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy. 352-377
- Bandwidth and Profile MinimizationManfred Wiegers, Burkhard Monien. 378-393
- On the Spanning Trees of Weighted GraphsErnst W. Mayr, C. Greg Plaxton. 394-405
- On Paths in Search or Decision Trees Which Require Almost Worst-Case TimeUlrich Huckenbeck. 406-423
- A Time-Optimal Parallel Algorithm for the Computing of Voronoi-DiagramsW. Preilowski, W. Mumbeck. 424-433
- Voronoi Diagrams in the Moscow Metric (Extended Abstract)Rolf Klein. 434-441
- A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem RevisitedKlaus Hinrichs, Jürg Nievergelt, Peter Schorn. 442-457