| 1993 | Probing a Set of Hyperplanes by Lines and Related Problems. | Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport |
| 1993 | Balanced Search Trees Made Simple. | Arne Andersson |
| 1993 | An Optimal Algorithm for Finding the Separation of Simple Polygons. | Nancy M. Amato |
| 1993 | Connected Component and Simple Polygon Intersection Searching (Extended Abstract). | Pankaj K. Agarwal, Marc J. van Kreveld |
| 1991 | A Linear-Time Scheme for Version Reconstruction (Extended Abstract). | Lin Yu, Daniel J. Rosenkrantz |
| 1991 | Neighborhood Graphs and Geometric Embedding. | F. Frances Yao |
| 1991 | On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. | Chung-Do Yang, D. T. Lee, C. K. Wong |
| 1991 | Dynamically Maintaining the Visibility Graph. | Gert Vegter |
| 1991 | Treewidth of Circular-Arc Graphs (Abstract). | Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan |
| 1991 | Shallow Interdistnace Selection and Interdistance Enumeration. | Jeffrey S. Salowe |
| 1991 | Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). | S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi |
| 1991 | Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space. | Marco Pellegrini |
| 1991 | An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. | Bengt J. Nilsson, Sven Schuierer |
| 1991 | Representing and Enumerating Edge Connectivity Cuts in RNC. | Dalit Naor, Vijay V. Vazirani |
| 1991 | Sorting Multisets and Vectors In-Place. | J. Ian Munro, Venkatesh Raman |
| 1991 | An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. | Bernard M. E. Moret, Henry D. Shapiro |
| 1991 | Finding Optimal Bipartitions of Points and Polygons. | Joseph S. B. Mitchell, Erik L. Wynters |
| 1991 | Unstructured Path Problems and the Making of Semirings (Preliminary Version). | Thomas Lengauer, Dirk Theune |
| 1991 | Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). | Naoki Katoh, Kazuo Iwano |
| 1991 | Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. | Sanjiv Kapoor, H. Ramesh |
| 1991 | Planar Graph Augmentation Problems (Extended Abstract). | Goos Kant, Hans L. Bodlaender |
| 1991 | What Can We Learn about Suffix Trees from Independent Tries? | Philippe Jacquet, Wojciech Szpankowski |
| 1991 | Fully Persistent Data Structures for Disjoint Set Union Problems. | Giuseppe F. Italiano, Neil Sarnak |
| 1991 | Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). | John Hershberger, Jack Snoeyink |
| 1991 | An Optimal Algorithm for Computing Visibility in the Plane. | Paul J. Heffernan, Joseph S. B. Mitchell |