| 1993 | Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings Ernst W. Mayr |
| 1992 | A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. Jianer Chen |
| 1992 | A New Characterization of Tree Medians with Applications to Distributed Algorithms. Ornan Ori Gerstel, Shmuel Zaks |
| 1992 | A Simple Test for Interval Graphs. Wen-Lian Hsu |
| 1992 | An Efficient Algorithm to Recognize Prime Undirected Graphs. Alain Cournier, Michel Habib |
| 1992 | Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Jordan Gergov, Christoph Meinel |
| 1992 | Embeddings in Recursive Combinatorial Networks. Sajal K. Das, Aisheng Mao |
| 1992 | Generalized Coloring for Tree-like Graphs. Klaus Jansen, Petra Scheffler |
| 1992 | Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming. Martin Erwig |
| 1992 | Hexagonal Grid Drawings. Goos Kant |
| 1992 | Improved Algorithms for Routing on Two-Dimensional Grids. Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton |
| 1992 | Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. Hans L. Bodlaender |
| 1992 | Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines. Edmund Ihler |
| 1992 | On Assembly of Four-Connected Graphs (Extended Abstract). Jianer Chen, Arkady Kanevsky |
| 1992 | On Improved Time Bounds for Permutation Graph Problems. Andreas Brandstädt |
| 1992 | On Scheduling Problems Restricted to Interval Orders. Klaus Jansen |
| 1992 | On Shortcutting Digraphs. Mikkel Thorup |
| 1992 | On the Complexity of Partial Order Properties. Stefan Felsner, Dorothea Wagner |
| 1992 | On the Homogeneous Decomposition of Graphs. Beverly Jamison, Stephan Olariu |
| 1992 | Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. Elias Dahlhaus |
| 1992 | Parallel Triangulation of Nonconvex Polytopes. Waldemar Preilowski |
| 1992 | Petri Nets, Hypergraphs and Conflicts (Preliminary Version). Paola Alimonti, Esteban Feuerstein |
| 1992 | Probabilistic Graph Grammars. Mohamed Mosbah |
| 1992 | Scheduling with Incompatible Jobs. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger |
| 1992 | Single vs. Double Pushout Derivations of Graphs. Francesco Parisi-Presicce |
| 1992 | The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. Yefim Dinitz |
| 1992 | The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. Una-May O'Reilly, Nicola Santoro |
| 1992 | The Power and the Limitations of Local Computations on Graphs. Igor Litovsky, Yves Métivier, Wieslaw Zielonka |
| 1992 | Tolerance Graphs and Orders. Stefan Felsner |
| 1992 | Topology of Parallel Networks and Computational Complexity (Extended Abstract). Juraj Hromkovic |