| 2002 | Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton |
| 2002 | Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. | Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe |
| 2002 | Partial Alphabetic Trees. | Arye Barkan, Haim Kaplan |
| 2002 | On the k-Splittable Flow Problem. | Georg Baier, Ekkehard Khler, Martin Skutella |
| 2002 | Implementing I/O-efficient Data Structures Using TPIE. | Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2002 | SCIL - Symbolic Constraints in Integer Linear Programming. | Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jnger, Thomas Kasper, Kurt Mehlhorn |
| 2002 | New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. | Dino Ahr, Gerhard Reinelt |
| 2002 | Approximation Algorithms for k-Line Center. | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan |
| 2002 | Translating a Planar Object to Maximize Point Containment. | Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl |
| 2002 | Near-Linear Time Approximation Algorithms for Curve Simplification. | Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang |
| 2002 | Range Searching in Categorical Data: Colored Range Searching on Grid. | Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan |
| 2002 | Kinetic Medians and kd-Trees. | Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas |
| 2001 | Exact and Approximate Distances in Graphs - A Survey. | Uri Zwick |
| 2001 | Greedy Algorithms for Minimisation Problems in Random Regular Graphs. | Michele Zito |
| 2001 | A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 2001 | Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. | Norbert Sensen |
| 2001 | Coupling Variable Fixing Algorithms for the Automatic Recording Problem. | Meinolf Sellmann, Torsten Fahle |
| 2001 | A General Decomposition Theorem for the k-Server Problem. | Steven S. Seiden |
| 2001 | Explicit Deterministic Constructions for Membership in the Bitprobe Model. | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | Lossy Dictionaries. | Rasmus Pagh, Flemming Friche Rodler |
| 2001 | Cuckoo Hashing. | Rasmus Pagh, Flemming Friche Rodler |
| 2001 | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. | Kurt Mehlhorn, Guido Schfer |
| 2001 | Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. | Renaud Lepre, Denis Trystram, Gerhard J. Woeginger |
| 2001 | Algorithms for Efficient Filtering in Content-Based Multicast. | Stefan Langerman, Sachin Lodha, Rahul Shah |
| 2001 | SNPs Problems, Complexity, and Algorithms. | Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz |