| 1992 | A New Characterization of Tree Medians with Applications to Distributed Algorithms. | Ornan Ori Gerstel, Shmuel Zaks |
| 1992 | Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. | Jordan Gergov, Christoph Meinel |
| 1992 | On the Complexity of Partial Order Properties. | Stefan Felsner, Dorothea Wagner |
| 1992 | Tolerance Graphs and Orders. | Stefan Felsner |
| 1992 | Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming. | Martin Erwig |
| 1992 | The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. | Yefim Dinitz |
| 1992 | Embeddings in Recursive Combinatorial Networks. | Sajal K. Das, Aisheng Mao |
| 1992 | Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. | Elias Dahlhaus |
| 1992 | An Efficient Algorithm to Recognize Prime Undirected Graphs. | Alain Cournier, Michel Habib |
| 1992 | On Assembly of Four-Connected Graphs (Extended Abstract). | Jianer Chen, Arkady Kanevsky |
| 1992 | A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. | Jianer Chen |
| 1992 | On Improved Time Bounds for Permutation Graph Problems. | Andreas Brandstdt |
| 1992 | Scheduling with Incompatible Jobs. | Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger |
| 1992 | Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. | Hans L. Bodlaender |
| 1992 | Improved Algorithms for Routing on Two-Dimensional Grids. | Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton |
| 1992 | Petri Nets, Hypergraphs and Conflicts (Preliminary Version). | Paola Alimonti, Esteban Feuerstein |
| 1991 | Nondeterministic Control Structures for Graph Rewriting Systems. | Albert Zndorf, Andy Schrr |
| 1991 | A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. | Tadao Takaoka |
| 1991 | Edge Separators for Graphs of Bounded Genus with Applications. | Ondrej Skora, Imrich Vrto |
| 1991 | On the Crossing Number of the Hypercube and the Cube Connected Cycles. | Ondrej Skora, Imrich Vrto |
| 1991 | On the Broadcast Time of the Butterfly network. | Elena Sthr |
| 1991 | Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. | Iain A. Stewart |
| 1991 | Using Maximal Independent Sets to Solve Problems in Parallel. | Takayoshi Shoudai |
| 1991 | Graph Rewriting Systems and their Application to Network Reliability Analysis. | Yasuyoshi Okada, Masahiro Hayashi |
| 1991 | On Complexity of Some Chain and Antichain Partition Problems. | Zbigniew Lonc |