| 1990 | Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings Manfred Nagl |
| 1989 | A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. Ingo Schiermeyer |
| 1989 | A Parser for Context Free Plex Grammars. Horst Bunke, B. Haller |
| 1989 | An Richard Anderson, Simon Kahan, Martine D. F. Schlag |
| 1989 | Beyond Steiner's Problem: A VLSI Oriented Generalization. Gabriele Reich, Peter Widmayer |
| 1989 | Bounds to the Page Number of Partially Ordered Sets. Maciej M. Syslo |
| 1989 | CADULA - A Graph-Based Model for Monitoring CAD-Processes. Detlev Ruland |
| 1989 | Combinatorial Properties of Abstract Voronoi Diagrams. Rolf Klein |
| 1989 | Describing Distributed Systems by Categorical Graph Grammars. Hans Jürgen Schneider |
| 1989 | Disjoint Paths in the Hypercube. Seshu Madhavapeddy, Ivan Hal Sudborough |
| 1989 | Filtering Hyperedge-Replacement Through Compatible Properties. Annegret Habel, Hans-Jörg Kreowski |
| 1989 | Finding Squares and Rectangles in Sets of Points. Marc J. van Kreveld, Mark de Berg |
| 1989 | Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. Klaus Simon |
| 1989 | Graph Rewriting Systems with Priorities. Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena |
| 1989 | Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. Frank K. H. A. Dehne, Andrew Rau-Chaplin |
| 1989 | Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. Hans L. Bodlaender |
| 1989 | Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. Andy Schürr |
| 1989 | On Feedback Problems in Diagraphs. Ewald Speckenmeyer |
| 1989 | On Hyperedge Replacement and BNLC Graph Grammars. Walter Vogler |
| 1989 | On the Complexity of Optimal Drawings of Graphs. Franz-Josef Brandenburg |
| 1989 | Paging Binary Trees with External Balancing. Andreas Henrich, Hans-Werner Six, Peter Widmayer |
| 1989 | The Complexity of Graph Problems for Succinctly Represented Graphs. Antoni Lozano, José L. Balcázar |
| 1989 | Time Bound for Broadcasting in Bounded Degree Graphs. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro |
| 1989 | Toward a Complete Representation of Graphoids in Graphs (Abridged Version). Robert Y. Geva, Azaria Paz |
| 1989 | WEighted Parallel Triangulation of Simple Polygons. Knut Menzel, Burkhard Monien |
| 1989 | k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points. Thomas Roos |
| 1989 | t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan |