| 2001 | A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. Eric Angel, Evripidis Bampis, Alexander V. Kononov |
| 2001 | A Fast Algorithm for Approximating the Detour of a Polygonal Chain. Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas |
| 2001 | A General Decomposition Theorem for the k-Server Problem. Steven S. Seiden |
| 2001 | A General Model of Undirected Web Graphs. Colin Cooper, Alan M. Frieze |
| 2001 | A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Kurt Mehlhorn, Guido Schäfer |
| 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 | A Separation Bound for Real Algebraic Expressions. Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |
| 2001 | A Simple Shortest Path Algorithm with Linear Average Time. Andrew V. Goldberg |
| 2001 | Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings Friedhelm Meyer auf der Heide |
| 2001 | Algorithms for Efficient Filtering in Content-Based Multicast. Stefan Langerman, Sachin Lodha, Rahul Shah |
| 2001 | An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. Stephan J. Eidenbenz, Peter Widmayer |
| 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 | Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. Renaud Lepère, Denis Trystram, Gerhard J. Woeginger |
| 2001 | Buying a Constant Competitive Ratio for Paging. János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger |
| 2001 | Competitive Auctions for Multiple Digital Goods. Andrew V. Goldberg, Jason D. Hartline |
| 2001 | Computing Cycle Covers without Short Cycles. Markus Bläser, Bodo Siebert |
| 2001 | Coupling Variable Fixing Algorithms for the Automatic Recording Problem. Meinolf Sellmann, Torsten Fahle |
| 2001 | Cuckoo Hashing. Rasmus Pagh, Flemming Friche Rodler |
| 2001 | Distributed O(Delta log(n))-Edge-Coloring Algorithm. Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski |
| 2001 | Duality between Prefetching and Queued Writing with Parallel Disks. David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2001 | Exact and Approximate Distances in Graphs - A Survey. Uri Zwick |
| 2001 | Explicit Deterministic Constructions for Membership in the Bitprobe Model. Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | External Memory Data Structures. Lars Arge |
| 2001 | Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan |
| 2001 | Finding Approximate Repetitions under Hamming Distance. Roman M. Kolpakov, Gregory Kucherov |
| 2001 | Greedy Algorithms for Minimisation Problems in Random Regular Graphs. Michele Zito |
| 2001 | Grouping Techniques for Scheduling Problems: Simpler and Faster. Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2001 | Lossy Dictionaries. Rasmus Pagh, Flemming Friche Rodler |
| 2001 | Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. Norbert Sensen |
| 2001 | Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. John R. Douceur, Roger Wattenhofer |
| 2001 | On the Approximability of the Minimum Test Collection Problem. Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi |
| 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 | Online Bin Coloring. Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie |
| 2001 | Online and Offline Distance Constrained Labeling of Disk Graphs. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin |
| 2001 | Packing Cycles and Cuts in Undirected Graphs. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi |
| 2001 | Property Testing with Geometric Queries. Artur Czumaj, Christian Sohler |
| 2001 | Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | SNPs Problems, Complexity, and Algorithms. Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz |
| 2001 | Simple Minimal Perfect Hashing in Less Space. Martin Dietzfelbinger, Torben Hagerup |
| 2001 | Smallest Color-Spanning Objects. Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán |
| 2001 | Some Algorithmic Problems in Large Networks. Susanne Albers |
| 2001 | Splitting a Delaunay Triangulation in Linear Time. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud |
| 2001 | Strongly Competitive Algorithms for Caching with Pipelined Prefetching. Alexander Gaysinsky, Alon Itai, Hadas Shachnai |