| 1987 | Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings Gottfried Tinhofer, Gunther Schmidt |
| 1986 | A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms. Horst F. Wedde |
| 1986 | A Simple Implementation of Warshall's Algorithm on a VLSI Chip. Ramesh Dewangan, C. Pandu Rangan |
| 1986 | A Simple Linear -TIme Algorithm to Recognize Interval Graphs. Norbert Korte, Rolf H. Möhring |
| 1986 | ADA Concurrency Specified by Graph Grammars. Manfred Jackel |
| 1986 | An Algorithm for Testing Planarity of Hierarchical Graphs. Giuseppe Di Battista, Enrico Nardelli |
| 1986 | An Approximation Algorithms for Steiner's Problem in Graphs. Peter Widmayer |
| 1986 | An Interactive Graphical Manipulation System for Higher Order Objects Based on Relational Algebra. Hans Zierer, Gunther Schmidt, Rudolf Berghammer |
| 1986 | Applications of Parallel Scheduling to Perfect Graphs. David P. Helmbold, Ernst W. Mayr |
| 1986 | Behaviour Preserving Refinement of Petri Nets. Walter Vogler |
| 1986 | CABRI, An Interactive System for Graph Manipulation. M. Dao, Michel Habib, J. P. Richard, Didier Tallot |
| 1986 | Centipede Graphs and Visibility on a Cylinder. Roberto Tamassia, Ioannis G. Tollis |
| 1986 | EDM - A Data Model for Electronic CAD/CAM-Applications. Detlev Ruland |
| 1986 | Graphs and Graph Polynomials of interest in Chemistry. Ivan Gutman |
| 1986 | Improved Diameter Bounds for Altered Graphs. Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen |
| 1986 | On Some Generalizations of Outerplanar Graphs: Results and Open Problems. Maciej M. Syslo |
| 1986 | Recognizing Outerplanar Graphs in Linear Time. Manfred Wiegers |
| 1986 | Searching Connected Components in Very Large Grid Graphs. Stephan Abramowski, Heinrich Müller |
| 1986 | Seperability of Sets of Polygons. Frank K. H. A. Dehne, Jörg-Rüdiger Sack |
| 1986 | Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity. Manfred Kaul |
| 1986 | The Bandwidth of Planar Distributive Lattices. Ulrich Faigle |
| 1986 | The Diameter of Connected Components of Random Graphs. Paul G. Spirakis |
| 1986 | The Node Visit Cost of Brother Trees. Rolf Klein, Derick Wood |