| 1994 | Finding and Counting Given Length Cycles (Extended Abstract). | Noga Alon, Raphael Yuster, Uri Zwick |
| 1993 | A Linear Algorithm for Edge-Coloring Partial k-Trees. | Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki |
| 1993 | Surface Reconstruction Between Simple Polygons via Angle Criteria. | Emo Welzl, Barbara Wolfers |
| 1993 | Sequence Comparison and Statistical Significance in Molecular Biology (Abstract). | Michael S. Waterman |
| 1993 | A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. | Dorothea Wagner, Karsten Weihe |
| 1993 | A Fully Dynamic Data Structure for Reachability in Planar Digraphs. | Sairam Subramanian |
| 1993 | Integer Multicommodity Flows with Reduced Demands. | Anand Srivastav, Peter Stangier |
| 1993 | On the Distribution of the Transitive Closure in a Random Acyclic Digraph. | Klaus Simon, Davide Crippa, Fabian Collenberg |
| 1993 | Randomized Routing on Meshes with Buses. | Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman |
| 1993 | Complexity of Disjoint Paths Problems in Planar Graphs. | Alexander Schrijver |
| 1993 | An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. | Vijaya Ramachandran, Honghua Yang |
| 1993 | Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection. | Sanguthevar Rajasekaran |
| 1993 | Evolution of an Algorithm. | Mike Paterson |
| 1993 | Optimal Tree Contraction on the Hypercube and Related Networks. | Ernst W. Mayr, Ralph Werchner |
| 1993 | The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). | Jan Karel Lenstra, Marinus Veldhorst |
| 1993 | Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. | Manfred Kunde |
| 1993 | Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1993 | On the Recognition of Permuted Bottleneck Monge Matrices. | Bettina Klinz, Rdiger Rudolf, Gerhard J. Woeginger |
| 1993 | Incresing the Vertex-Connectivity in Directed Graphs. | Tibor Jordn |
| 1993 | Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps. | Zoran Ivkovic, Errol L. Lloyd |
| 1993 | Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). | Giuseppe F. Italiano, Johannes A. La Poutr, Monika Rauch |
| 1993 | Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. | Juraj Hromkovic, Ralf Klasing, Elena Sthr, Hubert Wagener |
| 1993 | Three-Clustering of Points in the Plane. | Johann Hagauer, Gnter Rote |
| 1993 | The Bit Complexity of Distributed Sorting (Extended Abstract). | Ornan Ori Gerstel, Shmuel Zaks |
| 1993 | A Calculus of Random Generation. | Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem |