| 2003 | Lower bounds for embedding edit distance into normed spaces. | Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova |
| 2003 | Competitive queueing policies for QoS switches. | Nir Andelman, Yishay Mansour, An Zhu |
| 2003 | Inplace 2D matching in compressed images. | Amihood Amir, Gad M. Landau, Dina Sokol |
| 2003 | Matching planar maps. | Helmut Alt, Alon Efrat, Gnter Rote, Carola Wenk |
| 2003 | Labeling schemes for small distances in trees. | Stephen Alstrup, Philip Bille, Theis Rauhe |
| 2003 | Smaller explicit superconcentrators. | Noga Alon, Michael R. Capalbo |
| 2003 | Dynamic TCP acknowledgement: penalizing long delays. | Susanne Albers, Helge Bals |
| 2003 | Dynamic routing on networks with fixed-size buffers. | William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosn |
| 2002 | Computer assisted proof of optimal approximability results. | Uri Zwick |
| 2002 | Jenga. | Uri Zwick |
| 2002 | On directed Steiner trees. | Leonid Zosin, Samir Khuller |
| 2002 | Algorithms for quantified Boolean formulas. | Ryan Williams |
| 2002 | Approximating minimum quartet inconsistency (abstract). | Gianluca Della Vedova, Tao Jiang, Jing Li, Jianjun Wen |
| 2002 | Binary space partitions for line segments with a limited number of directions. | Csaba D. Tth |
| 2002 | Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. | Rahul Shah, Martin Farach-Colton |
| 2002 | New bounds for multi-dimensional packing. | Steven S. Seiden, Rob van Stee |
| 2002 | Succinct representations of lcp information and improvements in the compressed suffix arrays. | Kunihiko Sadakane |
| 2002 | How unfair is optimal routing? | Tim Roughgarden |
| 2002 | Roundtrip spanners and roundtrip routing in directed graphs. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2002 | The mathematics of playing golf. | Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger |
| 2002 | Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. | R. Ravi, David P. Williamson |
| 2002 | Approximating k-cuts via network strength. | R. Ravi, Amitabh Sinha II |
| 2002 | Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. | April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut |
| 2002 | Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2002 | Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. | Seth Pettie, Vijaya Ramachandran |