| 1991 | A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). Walter Cunto, J. Ian Munro, Patricio V. Poblete |
| 1991 | A Fast Derandomization Schemes and Its Applications. Yijie Han |
| 1991 | A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint |
| 1991 | A Linear-Time Scheme for Version Reconstruction (Extended Abstract). Lin Yu, Daniel J. Rosenkrantz |
| 1991 | Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| 1991 | Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. Sanjiv Kapoor, H. Ramesh |
| 1991 | An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. Bernard M. E. Moret, Henry D. Shapiro |
| 1991 | An Optimal Algorithm for Computing Visibility in the Plane. Paul J. Heffernan, Joseph S. B. Mitchell |
| 1991 | An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. Bengt J. Nilsson, Sven Schuierer |
| 1991 | Applications of a New Space Partitioning Technique. Pankaj K. Agarwal, Micha Sharir |
| 1991 | Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). Judit Bar-Ilan, David Peleg |
| 1991 | Competitive Algorithms for the Weighted List Update Problem. Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1991 | Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). John Hershberger, Jack Snoeyink |
| 1991 | Dynamically Maintaining the Visibility Graph. Gert Vegter |
| 1991 | Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). Naoki Katoh, Kazuo Iwano |
| 1991 | Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi |
| 1991 | Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri |
| 1991 | Finding Level-Ancestors in Dynamic Trees. Paul F. Dietz |
| 1991 | Finding Optimal Bipartitions of Points and Polygons. Joseph S. B. Mitchell, Erik L. Wynters |
| 1991 | Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. Olivier Devillers, Stefan Meiser, Monique Teillaud |
| 1991 | Fully Persistent Data Structures for Disjoint Set Union Problems. Giuseppe F. Italiano, Neil Sarnak |
| 1991 | Geometric Knapsack Problems. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell |
| 1991 | Geometric Searching and Link Distance (Extended Abstract). Gautam Das, Giri Narasimhan |
| 1991 | Immobilizing a Polytope. Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia |
| 1991 | Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond. Selim G. Akl |
| 1991 | Neighborhood Graphs and Geometric Embedding. F. Frances Yao |
| 1991 | Offline Algorithms for Dynamic Minimum Spanning Tree Problems. David Eppstein |
| 1991 | On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. Chung-Do Yang, D. T. Lee, C. K. Wong |
| 1991 | On Computing the Voronoi Diagram for Restricted Planar Figures. Hristo N. Djidjev, Andrzej Lingas |
| 1991 | On the Zone of a Surface in a Hyperplane Arrangement. Boris Aronov, Micha Sharir |
| 1991 | Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos |
| 1991 | Parametric Search and Locating Supply Centers in Trees. Greg N. Frederickson |
| 1991 | Planar Graph Augmentation Problems (Extended Abstract). Goos Kant, Hans L. Bodlaender |
| 1991 | Probabilistic Leader Election on Rings of Known Size. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick |
| 1991 | Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space. Marco Pellegrini |
| 1991 | Representing and Enumerating Edge Connectivity Cuts in RNC. Dalit Naor, Vijay V. Vazirani |
| 1991 | Shallow Interdistnace Selection and Interdistance Enumeration. Jeffrey S. Salowe |
| 1991 | Sharing Memory in Asynchronous Message Passing Systems. Oscar R. Anguilar, Ajoy Kumar Datta, Sukumar Ghosh |
| 1991 | Sorting Multisets and Vectors In-Place. J. Ian Munro, Venkatesh Raman |
| 1991 | The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point. Eric N. Hanson |
| 1991 | The MINSUMCUT Problem. Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán |
| 1991 | Treewidth of Circular-Arc Graphs (Abstract). Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan |
| 1991 | Unstructured Path Problems and the Making of Semirings (Preliminary Version). Thomas Lengauer, Dirk Theune |
| 1991 | What Can We Learn about Suffix Trees from Independent Tries? Philippe Jacquet, Wojciech Szpankowski |