| 1995 | On Some Geometric Selection and Optimization Problems via Sorted Matrices. | Alex Glozman, Klara Kedem, Gregory Shpitalnik |
| 1995 | Dynamic Algorithms for the Dyck Languages. | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Sren Skyum |
| 1995 | Tables Should Be Sorted (On Random Access Machines). | Faith E. Fich, Peter Bro Miltersen |
| 1995 | Two-Floodlight Illumination of Convex Polygons. | Vladimir Estivill-Castro, Jorge Urrutia |
| 1995 | A Linear Algorithm for the Maximal Planar Subgraph Problem. | Hristo N. Djidjev |
| 1995 | On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). | Gautam Das, Michael T. Goodrich |
| 1995 | Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. | Derek G. Corneil, Stephan Olariu, Lorna Stewart |
| 1995 | Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. | Yi-Jen Chiang |
| 1995 | Obstructions to Within a Few Vertices or Edges of Acyclic. | Kevin Cattell, Michael J. Dinneen, Michael R. Fellows |
| 1995 | Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. | Svante Carlsson, Hkan Jonsson |
| 1995 | Topology B-Trees and Their Applications. | Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer |
| 1995 | Fast Meldable Priority Queues. | Gerth Stlting Brodal |
| 1995 | Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. | Joan Boyar, Rolf Fagerberg, Kim S. Larsen |
| 1995 | Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. | Gianfranco Bilardi, Franco P. Preparata |
| 1995 | On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. | Piotr Berman, Toshihiro Fujito |
| 1995 | Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). | Vineet Bafna, Babu O. Narayanan, R. Ravi |
| 1995 | Competitive Algorithms for the On-line Traveling Salesman. | Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo |
| 1995 | Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). | Chris Armen, Clifford Stein |
| 1995 | The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). | Lars Arge |
| 1995 | A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. | Fred S. Annexstein, Eugene A. Kuchko |
| 1995 | On the Difficulty of Range Searching. | Arne Andersson, Kurt Swanson |
| 1995 | Page Migration with Limited Local Memory Capacity. | Susanne Albers, Hisashi Koga |
| 1993 | Groups and Algebraic Complexity (Abstract). | Andrew Chi-Chih Yao |
| 1993 | Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems. | Jeffery R. Westbrook, Dicky C. K. Yan |
| 1993 | Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. | Jan Arne Telle, Andrzej Proskurowski |