| 1994 | Direct Path Graph Isomorphism (Extended Abstract). | Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer |
| 1994 | Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). | Thomas Andreae, Michael Nlle, Gerald Schreiber |
| 1993 | The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. | Ingo Wegener |
| 1993 | Bounded Tree-Width and LOGCFL. | Egon Wanke |
| 1993 | Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. | Koichi Wada, Kimio Kawaguchi |
| 1993 | Improving Bounds for the Crossing Numbers on Surfaces of Genus g. | Farhad Shahrokhi, Lszl A. Szkely, Ondrej Skora, Imrich Vrto |
| 1993 | Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). | Farhad Shahrokhi, Lszl A. Szkely |
| 1993 | Deciding 3-Colourability in Less Than O(1.415^n) Steps. | Ingo Schiermeyer |
| 1993 | The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. | Sabine R. hring, Sajal K. Das |
| 1993 | Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. | Sotiris E. Nikoletseas, Paul G. Spirakis |
| 1993 | Linear Layouts of Generalized Hypercubes. | Koji Nakano |
| 1993 | On-line Graph Algorithms for Incremental Compilation. | Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert |
| 1993 | Hierarchical Specified Unit Disk Graphs (Extended Abstract). | Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi |
| 1993 | Toward a Solution of the Holyer's Problem. | Zbigniew Lonc |
| 1993 | Approximating the Chromatic Polynomial of a Graph. | Nai-Wei Lin |
| 1993 | Coloring k-Colorable Graphs in Constant Expected Parallel Time. | Ludek Kucera |
| 1993 | On Multi-Label Linear Interval Routing Schemes (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, S. S. Ravi |
| 1993 | Two Algorithms for Finding Rectangular Duals of Planar Graphs. | Goos Kant, Xin He |
| 1993 | A More Compact Visibility Representation. | Goos Kant |
| 1993 | A Rainbow About T-Colorings for Complete Graphs. | Klaus Jansen |
| 1993 | Fully Dynamic Maintenance of Vertex Cover. | Zoran Ivkovic, Errol L. Lloyd |
| 1993 | Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. | Juraj Hromkovic, Ralf Klasing, Elena Sthr |
| 1993 | Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. | N. W. Holloway, Somasundaram Ravindran, Alan Gibbons |
| 1993 | Graphs, Hypergraphs and Hashing. | George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech |
| 1993 | An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. | S. Haldar |