| 1993 | Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists. | Lucas Chi Kwong Hui, Charles U. Martel |
| 1993 | A Graph Coloring Result and Its Consequences for Some Guarding Problems. | Frank Hoffmann, Klaus Kriegel |
| 1993 | Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. | Xin He, Ming-Yang Kao |
| 1993 | Threshold Computation and Cryptographic Security. | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf |
| 1993 | New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. | Susanne E. Hambrusch, Hung-Yi Tu |
| 1993 | Parallel Algorithms for Single-Layer Channel Routing. | Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih |
| 1993 | Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. | Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang |
| 1993 | Coloring Random Graphs in Polynomial Expected Time. | Martin Frer, C. R. Subramanian, C. E. Veni Madhavan |
| 1993 | A 2or3-Approximation of the Matroid Matching Problem. | Toshihiro Fujito |
| 1993 | Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. | Satoshi Fujita, Masafumi Yamashita, Tadashi Ae |
| 1993 | Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. | Ulrich Fmeier, Michael Kaufmann, Alexander Zelikovsky |
| 1993 | A Simple Balanced Search Tree with O(1) Worst-Case Update Time. | Rudolf Fleischer |
| 1993 | Memory Paging for Connectivity and Path Problems in Graphs. | Esteban Feuerstein, Alberto Marchetti-Spaccamela |
| 1993 | Using Fractal Geometry for Solving Divide-and-Conquer Recurrences. | Simant Dube |
| 1993 | Remembering Conflicts in History Yields Dynamic Algorithms. | Katrin Dobrindt, Mariette Yvinec |
| 1993 | The Maximum k-Dependent and f-Dependent Set Problem. | Anders Dessmark, Klaus Jansen, Andrzej Lingas |
| 1993 | Robot Mapping: Foot-Prints versus Tokens. | Xiaotie Deng, Andy Mirzaian |
| 1993 | Constructing Degree-3 Spanners with Other Sparseness Properties. | Gautam Das, Paul J. Heffernan |
| 1993 | How to Treat Delete Requests in Semi-Online Problems. | Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh |
| 1993 | Permutation Routing on Reconfigurable Meshes. | J. C. Cogolludo, Sanguthevar Rajasekaran |
| 1993 | Page Migration Algorithms Using Work Functions. | Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook |
| 1993 | Optimal Rectilinear Steiner Tree for Extremal Point Sets. | Siu-Wing Cheng, Andrew Lim, Ching-Ting Wu |
| 1993 | Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. | Danny Z. Chen |
| 1993 | A Framework for Constructing Heap-Like Structures In-Place. | Jingsen Chen |
| 1993 | Scheduling Algorithms for a Chain-like Task System. | Chi-lok Chan, Gilbert H. Young |