| 2001 | Online Bin Coloring. | Sven Oliver Krumke, Willem de Paepe, Jrg Rambau, Leen Stougie |
| 2001 | Finding Approximate Repetitions under Hamming Distance. | Roman M. Kolpakov, Gregory Kucherov |
| 2001 | A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | Duality between Prefetching and Queued Writing with Parallel Disks. | David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2001 | On the Approximability of the Minimum Test Collection Problem. | Bjarni V. Halldrsson, Magns M. Halldrsson, R. Ravi |
| 2001 | Competitive Auctions for Multiple Digital Goods. | Andrew V. Goldberg, Jason D. Hartline |
| 2001 | A Simple Shortest Path Algorithm with Linear Average Time. | Andrew V. Goldberg |
| 2001 | Strongly Competitive Algorithms for Caching with Pipelined Prefetching. | Alexander Gaysinsky, Alon Itai, Hadas Shachnai |
| 2001 | Approximate Distance Labeling Schemes. | Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg |
| 2001 | Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. | Pierre Fraigniaud |
| 2001 | Grouping Techniques for Scheduling Problems: Simpler and Faster. | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2001 | Online and Offline Distance Constrained Labeling of Disk Graphs. | Jir Fiala, Aleksei V. Fishkin, Fedor V. Fomin |
| 2001 | An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. | Stephan J. Eidenbenz, Peter Widmayer |
| 2001 | A Fast Algorithm for Approximating the Detour of a Polygonal Chain. | Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas |
| 2001 | On the Parameterized Complexity of Layered Graph Drawing. | Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood |
| 2001 | Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. | John R. Douceur, Roger Wattenhofer |
| 2001 | Simple Minimal Perfect Hashing in Less Space. | Martin Dietzfelbinger, Torben Hagerup |
| 2001 | Distributed O(Delta log(n))-Edge-Coloring Algorithm. | Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski |
| 2001 | Property Testing with Geometric Queries. | Artur Czumaj, Christian Sohler |
| 2001 | Buying a Constant Competitive Ratio for Paging. | Jnos Csirik, Csand Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger |
| 2001 | A General Model of Undirected Web Graphs. | Colin Cooper, Alan M. Frieze |
| 2001 | Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | Splitting a Delaunay Triangulation in Linear Time. | Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Merc Mora, Vera Sacristn, Monique Teillaud |
| 2001 | Packing Cycles and Cuts in Undirected Graphs. | Alberto Caprara, Alessandro Panconesi, Romeo Rizzi |
| 2001 | A Separation Bound for Real Algebraic Expressions. | Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |