| 1981 | Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980 Hartmut Noltemeier |
| 1980 | A Birds Eye View to Path Problems. Bernd Mahr |
| 1980 | A Comparison Between Petri-Nets and Graph Grammars. Hans-Jörg Kreowski |
| 1980 | A Framework for Data Structures. Hans-Werner Six |
| 1980 | A Graph Grammar Representation of Non-Sequential Processes. Wolfgang Reisig |
| 1980 | A New Data Structure for Representing Sorted Lists. Kurt Mehlhorn |
| 1980 | Alternative Cycle Covers and Paths. Oliver Vornberger |
| 1980 | An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. Shimon Even, Yacov Yacobi |
| 1980 | Bounding the Bandwidth of NP-Complete Problems. Burkhard Monien, Ivan Hal Sudborough |
| 1980 | F-Factors, Perfect Matchings and Related Concepts. Ulrich Derigs |
| 1980 | Generating All Planar 0-, 1-, 2-, 3-Connected Graphs. Peter Läuchli |
| 1980 | Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà |
| 1980 | Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. Manfred Schnitzler |
| 1980 | Graph Rewriting and Automatic, Machine-Independent Program Optimization. Manfred Nagl |
| 1980 | Investigating Programs in Terms of Partial Graphs. Gunther Schmidt |
| 1980 | Issues in the Study of Graph Embeddings. Arnold L. Rosenberg |
| 1980 | On Linearizing Graphs. Kurt-Ulrich Witt |
| 1980 | On a Generalization of Heaps. Hartmut Noltemeier |
| 1980 | On the Use of Some Almost Sure Graph Properties. Gottfried Tinhofer |
| 1980 | Optimal (s, t)-Cuts (Extended Abstract). Horst W. Hamacher |
| 1980 | Properties of Ordered Graph Grammars. Helmut J. Ludwigs |
| 1980 | Reachablity Homomorphisms on Nets. Jürgen Ebert, Jürgen Perl |
| 1980 | Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design. Carlo Batini, Alessandro D'Atri |
| 1980 | Series of Graphs Generated by Rational Machines. Hidenosuke Nishio |
| 1980 | Set-Theoretic Concepts in Programming Languages and their Implementation. Hans Jürgen Schneider |
| 1980 | The Analysis of Search Trees: A Survey. Thomas Ottmann, Hans-Werner Six, Derick Wood |
| 1980 | The Chinese Postman Problem for Mixed Graphs. Peter Brucker |
| 1980 | The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. Ivan Hal Sudborough |
| 1980 | The Post-Office Problem and Related Questions. Hermann A. Maurer |
| 1980 | The Power of a One-Dimensional Vector of Processors. Jon Louis Bentley, Thomas Ottmann |
| 1980 | The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. Peter Kandzia, Margret Mangelmann |