| 1983 | The Locus Approach. | Mark H. Overmars |
| 1983 | A Combinatorial Rearrangement Problem with Implications to the Embedding of Graphs. | Heinrich Mller, Stephan Abramowski |
| 1983 | The Complexity of Determining Paths of Length k. | Burkhard Monien |
| 1983 | Granularity of Memory in Parallel Computation. | Kurt Mehlhorn, Uzi Vishkin |
| 1983 | Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction. | Thomas Lengauer |
| 1983 | Parallel Computation Using Meshes of Trees. | Tom Leighton |
| 1983 | Finding Shortest Paths in Very Large Networks. | Eugene L. Lawler, Michael George Luby, B. Parker |
| 1983 | Gridless Channelrouting Revisited - a New Formulation of the Problem. | Ulrich Lauther, Martin Nett |
| 1983 | Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring. | Marek Kubale, E. Kusz |
| 1983 | Performance of Index Structures for Databases. | Hans-Peter Kriegel |
| 1983 | Graph Grammar Derivation Processes. | Hans-Jrg Kreowski |
| 1983 | Relational Data Base Schemas with Functional Dependencies and Objects. | Peter Kandzia |
| 1983 | Neighbourhood-Uniform NLC Grammars. | Dirk Janssens, Grzegorz Rozenberg |
| 1983 | The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. | Klaus H. Hinrichs, Jrg Nievergelt |
| 1983 | Interfacing and Transforming Knowledge Bases in a Graph Grammar Based Documentation System. | R. Heinonen, Eero Hyvnen |
| 1983 | Concurrent Transformations of Graphs and Relational Structures. | Hartmut Ehrig, Annegret Habel |
| 1983 | Finding Extreme Distances between Convex Polygons. | Herbert Edelsbrunner |
| 1983 | Application of Attributed Graph Grammars to VLSI Design. | Wolfgang Brendel |
| 1983 | On the Complexity of the Membership Problem of Graph Grammars. | Franz-Josef Brandenburg |
| 1983 | Contour Extraction Via Path Algorithms. | M. Bertier, M. Habib |
| 1983 | A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. | Reuven Bar-Yehuda, Shimon Even |
| 1983 | Probabilistic Models for Database Schemes and Random Hypergraphs. | Giorgio Ausiello, Marco Protasi, Maurizio Talamo |
| 1982 | The Separation Problem. | Oliver Vornberger |
| 1982 | Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley Algorithm. | Alfred Schmitt |
| 1982 | Flowshop Scheduling with no Wait in Process on Three Machines. | Hans Rck |