| 1982 | Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees. | Mark H. Overmars |
| 1982 | The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse Graphs. | H. Mller |
| 1982 | The Complexity of Determing a Shortest Cycle of Even Length. | Burkhard Monien |
| 1982 | Iterative Algorithms on Grammar Graphs. | Ulrich Mncke, Reinhard Wilhelm |
| 1982 | Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study. | Bernd Mahr, Anne Wilharm |
| 1982 | On the Solution of Inequality Systems Relevant to IC-Layout. | Thomas Lengauer |
| 1982 | On Concurrency Control in Shared B-Trees. | Georg Lausen |
| 1982 | Decomposing Data for Comparison in Systolic (VLSI) Arrays. | Reinhard Laue |
| 1982 | Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database Systems. | Hans-Peter Kriegel |
| 1982 | Concurrency of Node-Label-Controlled Graph Transformations. | Dirk Janssens, Hans-Jrg Kreowski, Grzegorz Rozenberg, Hartmut Ehrig |
| 1982 | K Best Cuts in Planar and Nonplanar Networks. | Horst W. Hamacher |
| 1982 | A Language for Linearizing Graphics. | Herbert Gttler, A. Vlk |
| 1982 | Specification of a Programming Support Environment by Graph Grammars. | Gregor Engels, Wilhelm Schfer |
| 1982 | A Linear Disjoint Path Algorithm. | J. Ebert |
| 1982 | Network Flows in Trees and Knapsack Problems with Nested Constraints. | Peter Brucker |
| 1982 | A Relational View on Gotos and Dynamic Logic. | Rudolf Berghammer, Gunther Schmidt |
| 1982 | Kernels in Bipartite Graphs. | Gunther Schmidt, Thomas Strhlein |
| 1981 | Finite Graph-Automata. | Kurt-Ulrich Witt |
| 1981 | A Travelling Salesman Problem with Additional Constraints. | Gottfried Tinhofer |
| 1981 | On the Existence of F-Factors. | Frank X. Steinparz |
| 1981 | Reporting Geometric Inclusions with an Application to the Hidden Line Problem. | Alfred Schmitt |
| 1981 | Three-Dimensional VLSI Layouts. | Arnold L. Rosenberg |
| 1981 | Bus Routing Problems on Acyclic Networks. | Hans Rck |
| 1981 | Transforming Semi-Dynamic Data Structures into Dynamic Structures. | Mark H. Overmars |
| 1981 | 1-Pass Top-Down Update Schemes for Balanced Search Trees. | Thomas Ottmann, Michael Schrapp |