| 2002 | On-line algorithms for the dynamic traveling repair problem. | Sandy Irani, Xiangwen Lu, Amelia Regan |
| 2002 | Explicit constructions of selectors and related combinatorial structures, with applications. | Piotr Indyk |
| 2002 | Symmetric drawings of triconnected planar graphs. | Seok-Hee Hong, Brendan D. McKay, Peter Eades |
| 2002 | Polynomial time recognition of P4-structure. | Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed |
| 2002 | An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing. | David Hart |
| 2002 | MAX CUT in cubic graphs. | Eran Halperin, Dror Livnat, Uri Zwick |
| 2002 | Generalized clustering. | Sudipto Guha, Kamesh Munagala |
| 2002 | Improved algorithms for the data placement problem. | Sudipto Guha, Kamesh Munagala |
| 2002 | Capacitated vertex covering with applications. | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or |
| 2002 | Approximate distance oracles for geometric graphs. | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 2002 | Light spanners and approximate TSP in weighted graphs with forbidden minors. | Michelangelo Grigni, Papa A. Sissokho |
| 2002 | Caching with expiration times. | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
| 2002 | The wake up and report problem is time-equivalent to the firing squad synchronization problem. | Darin Goldstein, Nick Meyer |
| 2002 | On adaptive deterministic gossiping in ad hoc radio networks. | Leszek Gasieniec, Andrzej Lingas |
| 2002 | Expansion of product replacement graphs. | Alexander Gamburd, Igor Pak |
| 2002 | An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. | Harold N. Gabow |
| 2002 | Smooth-surface reconstruction in near-linear time. | Stefan Funke, Edgar A. Ramos |
| 2002 | Experimental analysis of simple, distributed vertex coloring algorithms. | Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri |
| 2002 | Censorship resistant peer-to-peer content addressable networks. | Amos Fiat, Jared Saia |
| 2002 | Web caching with request reordering. | Toms Feder, Rajeev Motwani, Rina Panigrahy, An Zhu |
| 2002 | Layout area of the hypercube (extended abstract). | Shimon Even, Roni Kupershtok |
| 2002 | An approximation algorithm for the group Steiner problem. | Guy Even, Guy Kortsarz |
| 2002 | NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. | Thomas Erlebach, Alexander Hall |
| 2002 | Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". | Jeff Erickson |
| 2002 | Harmonic broadcasting is optimal. | Lars Engebretsen, Madhu Sudan |