| 2001 | Distance labeling in graphs. | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
| 2001 | Reconstructing a collection of curves with corners and endpoints. | Stefan Funke, Edgar A. Ramos |
| 2001 | The probabilistic relationship between the assignment and asymmetric traveling salesman problems. | Alan M. Frieze, Gregory B. Sorkin |
| 2001 | Testing graphs for colorable properties. | Eldar Fischer |
| 2001 | Making data structures confluently persistent. | Amos Fiat, Haim Kaplan |
| 2001 | An experimental study of an opportunistic index. | Paolo Ferragina, Giovanni Manzini |
| 2001 | Polynomial-time approximation schemes for geometric graphs. | Thomas Erlebach, Klaus Jansen, Eike Seidel |
| 2001 | Fast approximation of centrality. | David Eppstein, Joseph Wang |
| 2001 | Internet packet filter management and rectangle geometry. | David Eppstein, S. Muthukrishnan |
| 2001 | Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. | David Eppstein |
| 2001 | Parallel processor scheduling with delay constraints. | Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl |
| 2001 | Pattern matching for sets of segments. | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian |
| 2001 | Morphing between polylines. | Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali |
| 2001 | Optimal constrained graph exploration. | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar |
| 2001 | Approximation algorithms for TSP with neighborhoods in the plane. | Adrian Dumitrescu, Joseph S. B. Mitchell |
| 2001 | On validating planar worlds. | Vida Dujmovic, Sue Whitesides |
| 2001 | Lattice approximation and linear discrepency of totally unimodular matrices. | Benjamin Doerr |
| 2001 | Universal configurations in light-flipping games. | Yevgeniy Dodis, Peter Winkler |
| 2001 | On universally easy classes for NP-complete problems. | Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2001 | A linear lower bound on index size for text retrieval. | Erik D. Demaine, Alejandro Lpez-Ortiz |
| 2001 | Computing optimal alpha-fat and alpha-small decompositions. | Mirela Damian-Iordache, Sriram V. Pemmaraju |
| 2001 | Soft kinetic data structures. | Artur Czumaj, Christian Sohler |
| 2001 | Better approximation algorithms for bin covering. | Jnos Csirik, David S. Johnson, Claire Kenyon |
| 2001 | A faster implementation of the Goemans-Williamson clustering algorithm. | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | Approximation algorithms for extensible bin packing. | Edward G. Coffman Jr., George S. Lueker |