| 1983 | Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany. Hans Jürgen Schneider, Herbert Göttler |
| 1982 | A Language for Linearizing Graphics. Herbert Göttler, A. Völk |
| 1982 | A Linear Disjoint Path Algorithm. J. Ebert |
| 1982 | A Relational View on Gotos and Dynamic Logic. Rudolf Berghammer, Gunther Schmidt |
| 1982 | Concurrency of Node-Label-Controlled Graph Transformations. Dirk Janssens, Hans-Jörg Kreowski, Grzegorz Rozenberg, Hartmut Ehrig |
| 1982 | Decomposing Data for Comparison in Systolic (VLSI) Arrays. Reinhard Laue |
| 1982 | Flowshop Scheduling with no Wait in Process on Three Machines. Hans Röck |
| 1982 | Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study. Bernd Mahr, Anne Wilharm |
| 1982 | Iterative Algorithms on Grammar Graphs. Ulrich Möncke, Reinhard Wilhelm |
| 1982 | K Best Cuts in Planar and Nonplanar Networks. Horst W. Hamacher |
| 1982 | Kernels in Bipartite Graphs. Gunther Schmidt, Thomas Ströhlein |
| 1982 | Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees. Mark H. Overmars |
| 1982 | Network Flows in Trees and Knapsack Problems with Nested Constraints. Peter Brucker |
| 1982 | On Concurrency Control in Shared B-Trees. Georg Lausen |
| 1982 | On the Solution of Inequality Systems Relevant to IC-Layout. Thomas Lengauer |
| 1982 | Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley Algorithm. Alfred Schmitt |
| 1982 | Specification of a Programming Support Environment by Graph Grammars. Gregor Engels, Wilhelm Schäfer |
| 1982 | The Complexity of Determing a Shortest Cycle of Even Length. Burkhard Monien |
| 1982 | The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse Graphs. H. Müller |
| 1982 | The Separation Problem. Oliver Vornberger |
| 1982 | Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database Systems. Hans-Peter Kriegel |