| 1993 | Computing the Smallest k-Enclosing Circle and Related Problems. | Alon Efrat, Micha Sharir, Alon Ziv |
| 1993 | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. | Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec |
| 1993 | The K-D Heap: An Efficient Multi-dimensional Priority Queue. | Yuzheng Ding, Mark Allen Weiss |
| 1993 | Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). | Paul F. Dietz, Rajeev Raman |
| 1993 | Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. | Olivier Devillers, Andreas Fabri |
| 1993 | Static and Dynamic Algorithms for k-Point Clustering Problems. | Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid |
| 1993 | Tolerating Faults in Meshes and Other Networks (Abstract). | Richard Cole |
| 1993 | Global Strategies for Augmenting the Efficiency of TSP Heuristics. | Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta |
| 1993 | Algorithms for Polytope Covering and Approximation. | Kenneth L. Clarkson |
| 1993 | On the Complexity of Graph Embeddings (Extended Abstract). | Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky |
| 1993 | Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract). | Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw |
| 1993 | Filling Polyhedral Molds. | Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint |
| 1993 | Pattern Matching for Permutations. | Prosenjit Bose, Jonathan F. Buss, Anna Lubiw |
| 1993 | Towards a Better Understanding of the Pure Packet Routing. | Allan Borodin |
| 1993 | Parallel Construction of Quadtrees and Quality Triangulations. | Marshall W. Bern, David Eppstein, Shang-Hua Teng |
| 1993 | Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. | Omer Berkman, Yossi Matias, Prabhakar Ragde |
| 1993 | Separating the Power of EREW and CREW PRAMs with Small Communication Width. | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
| 1993 | Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). | Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu |
| 1993 | The Complexity of Finding Certain Trees in Tournaments. | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
| 1993 | Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. | Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan |
| 1993 | Online Load Balancing of Temporary Tasks. | Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts |
| 1993 | Computing the All-Pairs Longest Chain in the Plane. | Mikhail J. Atallah, Danny Z. Chen |
| 1993 | A Dynamic Separator Algorithm. | Deganit Armon, John H. Reif |
| 1993 | Point Probe Decision Trees for Geometric Concept Classes. | Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena |
| 1993 | A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. | Lars Arge, Mikael B. Knudsen, Kirsten Larsen |