| 1994 | Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings Jan van Leeuwen |
| 1993 | A More Compact Visibility Representation. Goos Kant |
| 1993 | A Rainbow About T-Colorings for Complete Graphs. Klaus Jansen |
| 1993 | Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). Martin Charles Golumbic, Haim Kaplan, Ron Shamir |
| 1993 | An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. S. Haldar |
| 1993 | Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. N. W. Holloway, Somasundaram Ravindran, Alan Gibbons |
| 1993 | Approximating the Chromatic Polynomial of a Graph. Nai-Wei Lin |
| 1993 | Asteroidal Triple-Free Graphs. Derek G. Corneil, Stephan Olariu, Lorna Stewart |
| 1993 | Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer |
| 1993 | Bounded Tree-Width and LOGCFL. Egon Wanke |
| 1993 | Coloring k-Colorable Graphs in Constant Expected Parallel Time. Ludek Kucera |
| 1993 | Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). Farhad Shahrokhi, László A. Székely |
| 1993 | Deciding 3-Colourability in Less Than O(1.415^n) Steps. Ingo Schiermeyer |
| 1993 | Dually Chordal Graphs. Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |
| 1993 | Dynamic Algorithms for Graphs with Treewidth 2. Hans L. Bodlaender |
| 1993 | Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. Koichi Wada, Kimio Kawaguchi |
| 1993 | Fast Load Balancing in Cayley Graphs and in Circuits. Jacques E. Boillat |
| 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 Stöhr |
| 1993 | Graph Ear Decompositions and Graph Embeddings (Extended Abstract). Jianer Chen, Saroja P. Kanchi |
| 1993 | Graphs, Hypergraphs and Hashing. George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech |
| 1993 | Hierarchical Specified Unit Disk Graphs (Extended Abstract). Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi |
| 1993 | Improving Bounds for the Crossing Numbers on Surfaces of Genus g. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto |
| 1993 | Linear Layouts of Generalized Hypercubes. Koji Nakano |
| 1993 | Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. Sotiris E. Nikoletseas, Paul G. Spirakis |
| 1993 | On Multi-Label Linear Interval Routing Schemes (Extended Abstract). Evangelos Kranakis, Danny Krizanc, S. S. Ravi |
| 1993 | On Reduction Algorithms for Graphs with Small Treewidth. Hans L. Bodlaender |
| 1993 | On-line Graph Algorithms for Incremental Compilation. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert |
| 1993 | Regular Marked Petri Nets. Jörg Desel |
| 1993 | Short Disjoint Cycles in Graphs with Degree Constraints. Andreas Brandstädt, Heinz-Jürgen Voss |
| 1993 | The Asynchronous Committee Meeting Problem. Javier Esparza, Bernhard von Stengel |
| 1993 | The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. Sabine R. Öhring, Sajal K. Das |
| 1993 | The Parallel Complexity of Elimination Ordering Procedures. Elias Dahlhaus |
| 1993 | The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. Ingo Wegener |
| 1993 | Toward a Solution of the Holyer's Problem. Zbigniew Lonc |
| 1993 | Two Algorithms for Finding Rectangular Duals of Planar Graphs. Goos Kant, Xin He |