| 2002 | The freeze-tag problem: how to wake up a swarm of robots. | Esther M. Arkin, Michael A. Bender, Sndor P. Fekete, Joseph S. B. Mitchell, Martin Skutella |
| 2002 | Frugal path mechanisms. | Aaron Archer, va Tardos |
| 2002 | Scheduling protocols for switches with large envelopes. | Matthew Andrews, Lisa Zhang |
| 2002 | On-line scheduling of a single machine to minimize total weighted completion time. | Edward J. Anderson, Chris N. Potts |
| 2002 | Separable attributes: a technique for solving the sub matrices character count problem. | Amihood Amir, Kenneth Ward Church, Emanuel Dar |
| 2002 | Improved labeling scheme for ancestor queries. | Stephen Alstrup, Theis Rauhe |
| 2002 | Testing satisfiability. | Noga Alon, Asaf Shapira |
| 2002 | Guessing secrets efficiently via list decoding. | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan |
| 2002 | Pseudo-line arrangements: duality, algorithms, and applications. | Pankaj K. Agarwal, Micha Sharir |
| 2002 | Computing the writhing number of a polygonal knot. | Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang |
| 2002 | Pricing multicasting in more practical network models. | Micah Adler, Dan Rubenstein |
| 2002 | Is the internet fractal? | Cdric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski |
| 2001 | Shape sensitive geometric permutations. | Yunhong Zhou, Subhash Suri |
| 2001 | Practical approximation algorithms for zero- and bounded-skew trees. | Alexander Zelikovsky, Ion I. Mandoiu |
| 2001 | Assigning chain-like tasks to a chain-like network. | Gerhard J. Woeginger |
| 2001 | Absolute convergence: true trees from short sequences. | Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John |
| 2001 | Distribution sort with randomizing cycle. | Jeffrey Scott Vitter, David A. Hutchinson |
| 2001 | Approximating the minimum strongly connected subgraph via a matching lower bound. | Adrian Vetta |
| 2001 | Domatic partitions and the Lovsz local lemma. | Aravind Srinivasan |
| 2001 | New approaches to covering and packing problems. | Aravind Srinivasan |
| 2001 | Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. | Martin Skutella, Marc Uetz |
| 2001 | On the midpath tree conjuncture: a counter-example. | Rahul Shah, Martin Farach-Colton |
| 2001 | Reconciling simplicity and realism in parallel disk models. | Peter Sanders |
| 2001 | Approximately covering by cycles in planar graphs. | Dieter Rautenbach, Bruce A. Reed |
| 2001 | Robust algorithms for restricted domains. | Vijay Raghavan, Jeremy P. Spinrad |