| 1989 | Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings Jan van Leeuwen |
| 1988 | (Time × Space)-Efficient Implementations of Hierarchical Conceptual Models. Nicola Santoro |
| 1988 | A Graph-Based Decomposition Approach for Recursive Query Processing. Dietmar Seipel |
| 1988 | A Parallel Algorithm for Channel Routing. John E. Savage, Markus G. Wloka |
| 1988 | A Simple Systolic Method to Find all Bridges of an Undirected Graph. Manfred Schimmler, Heiko Schröder |
| 1988 | A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited. Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn |
| 1988 | A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams. Waldemar Preilowski, W. Mumbeck |
| 1988 | An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. Tadao Takaoka |
| 1988 | Application of Graph Theory to Topology Generation for Logic Gates. Hubert Kaeslin |
| 1988 | Bandwidth and Profile Minimization. Manfred Wiegers, Burkhard Monien |
| 1988 | Colouring Perfect Planar Graphs in Parallel. Iain A. Stewart |
| 1988 | Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints. Udo W. Lipeck, Dasu Feng |
| 1988 | DFS Tree Construction: Algorithms and Characterizations. Ephraim Korach, Zvi Ostfeld |
| 1988 | Dominance in the Presence of Obstracles. Mark de Berg, Mark H. Overmars |
| 1988 | Epsilon-Nets for Halfplanes. Gerhard J. Woeginger |
| 1988 | Fault Tolerant Networks of Specified Diameter. Henk Meijer, R. Dawes |
| 1988 | Graph-Theoretic Properties Compatible with Graph Derivations. Annegret Habel |
| 1988 | Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). Andrzej Lingas |
| 1988 | Linear Time Algorithms for Testing Approximate Congruence in the Plane. Sebastian Iwanowski |
| 1988 | Moving Regular k-Gons in Contact. Stephan Abramowski, Bruno Lang, Heinrich Müller |
| 1988 | NC-Algorithms for Graphs with Small Treewidth. Hans L. Bodlaender |
| 1988 | O(n²) Algorithms for Graph Planarization. R. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy |
| 1988 | On Paths in Search or Decision Trees Which Require Almost Worst-Case Time. Ulrich Huckenbeck |
| 1988 | On Systems of Equations Defining Infinite Graphs. Michel Bauderon |
| 1988 | On the Estimate of a Directed Graph. Alberto Marchetti-Spaccamela |
| 1988 | On the Spanning Trees of Weighted Graphs. Ernst W. Mayr, C. Greg Plaxton |
| 1988 | Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). Otto Nurmi, Jörg-Rüdiger Sack |
| 1988 | Serializable Graphs. K. Vidyasankar |
| 1988 | The Average Size of Ordered Binary Subgraphs. Pieter H. Hartel |
| 1988 | The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs. Bruno Courcelle |
| 1988 | Transitive Closure Algorithms for Very Large Databases. Joachim Biskup, Holger Stiefeling |
| 1988 | Voronoi Diagrams in the Moscow Metric (Extended Abstract). Rolf Klein |