| 1981 | A Realistic Cost Measure for Binary Search Trees. | Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood |
| 1981 | An Algorithm for the Compilation of Arithmetic Expressions Generating an Associated Tree with Minimal Weighted Height. | Wilhelm Oberaigner |
| 1981 | Four Approximation Algorithms for the Feedback Vertex Set Problem. | Burkhard Monien, Reinald Schulz |
| 1981 | Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. | Kurt Mehlhorn |
| 1981 | Untangling a Travelling Salesman Tour in the Plane. | Jan van Leeuwen, Anneke A. Schoone |
| 1981 | Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. | D. T. Lee, Franco P. Preparata |
| 1981 | The Write Fixed Serializability Problem of Interleaved Database Transactions. | Georg Lausen |
| 1981 | Description and Simulation of Processes Using Condensed Nets. | U. Knitelius, H. Lorenz, J. Perl, H.-J. Schrder |
| 1981 | Linear Precedence Parsing for a New Class of Graph Grammars. | Manfred Kaul |
| 1981 | The Complexity of Constructing Quad-Trees in Arbitrary Dimensions. | K. J. Jaquemain |
| 1981 | A Structural Text Editor Based on Graph Grammars. | R. Heinonen |
| 1981 | VLSI Algorithms for the Connected Component Problem and its Verification Problem. | Susanne E. Hambrusch |
| 1981 | Efficient Routes in Vector-Valued Graphs. | Walter Habenicht |
| 1981 | Structured Development of Modular Software Systems: The Module Graph as Central Data Structure. | Rupert Gall |
| 1981 | A Negative Circuit Algorithm for Weighted Min Cost Flows. | Helmut Friesdorf, Horst W. Hamacher |
| 1981 | On Protocols for Cake Cutting. | Shimon Even |
| 1981 | A Graph-Theoretical Model for Multi-Pass Parsing. | Hartmut Ehrig, Berthold Hoffmann, Ilse Schmiedecke |
| 1981 | The Shape of a Set of Points in the Plane. | Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel |
| 1981 | Depth-First Search Algorithms for Augmentation Problems. | Jrgen Ebert |
| 1981 | Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm. | Karl Drre, Johannes Heuft, Heinrich Mller |
| 1981 | Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata. | Carlo Batini, Alessandro D'Atri, Marina Moscarini |
| 1981 | Basic Graphtheoretical Structures for Multi Processor Concepts. | Rudolf F. Albrecht |
| 1980 | On Linearizing Graphs. | Kurt-Ulrich Witt |
| 1980 | Alternative Cycle Covers and Paths. | Oliver Vornberger |
| 1980 | On the Use of Some Almost Sure Graph Properties. | Gottfried Tinhofer |