| 1992 | 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings Gunther Schmidt, Rudolf Berghammer |
| 1991 | A Generalized Encryption Scheme Based on Random Graphs. Ludek Kucera |
| 1991 | A Language for Generic Graph-Transformations. Marc Andries, Jan Paredaens |
| 1991 | A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. Tadao Takaoka |
| 1991 | Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson |
| 1991 | Attributed Elementary Programmed Graph Grammars. Rudolf Freund, Brigitte Haberstroh |
| 1991 | Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. Iain A. Stewart |
| 1991 | Dynamic Algorithms for Shortest Paths in Planar Graphs. Esteban Feuerstein, Alberto Marchetti-Spaccamela |
| 1991 | Edge Separators for Graphs of Bounded Genus with Applications. Ondrej Sýkora, Imrich Vrto |
| 1991 | Fast Parallel Algorithms for Coloring Random Graphs. Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
| 1991 | Graph Rewriting Systems and their Application to Network Reliability Analysis. Yasuyoshi Okada, Masahiro Hayashi |
| 1991 | Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu |
| 1991 | Logic Arrays for Interval Indicator Functions. Peter Damaschke |
| 1991 | Monadic Second-Order Evaluations on Tree-Decomposable Graphs. Bruno Courcelle, Mohamed Mosbah |
| 1991 | Nondeterministic Control Structures for Graph Rewriting Systems. Albert Zündorf, Andy Schürr |
| 1991 | On Complexity of Some Chain and Antichain Partition Problems. Zbigniew Lonc |
| 1991 | On Disjoint Cycles. Hans L. Bodlaender |
| 1991 | On the Broadcast Time of the Butterfly network. Elena Stöhr |
| 1991 | On the Crossing Number of the Hypercube and the Cube Connected Cycles. Ondrej Sýkora, Imrich Vrto |
| 1991 | Optimal Embedding of Complete Binary Trees into Lines and Grids. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |
| 1991 | Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection. Xiaoyi Jiang, Horst Bunke |
| 1991 | Short Disjoint Cycles in Cubic Bridgeless Graphs. Andreas Brandstädt |
| 1991 | The Complexity of Approximating the Class Steiner Tree Problem. Edmund Ihler |
| 1991 | Tight Bounds for the Rectangualr Art Gallery Problem. Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks |
| 1991 | Using Maximal Independent Sets to Solve Problems in Parallel. Takayoshi Shoudai |
| 1991 | Voronoi Diagrams of Moving Points in the Plane. Leonidas J. Guibas, Joseph S. B. Mitchell |