| 2001 | Computing Cycle Covers without Short Cycles. | Markus Blser, Bodo Siebert |
| 2001 | External Memory Data Structures. | Lars Arge |
| 2001 | A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. | Eric Angel, Evripidis Bampis, Alexander V. Kononov |
| 2001 | Some Algorithmic Problems in Large Networks. | Susanne Albers |
| 2001 | Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. | Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan |
| 2001 | Smallest Color-Spanning Objects. | Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Beln Palop, Vera Sacristn |
| 2000 | Collision Detection Using Bounding Boxes: Convexity Helps. | Yunhong Zhou, Subhash Suri |
| 2000 | Coloring Sparse Random Graphs in Polynominal Average Time. | C. R. Subramanian |
| 2000 | Computing Optimal Linear Layouts of Trees in Linear Time. | Konstantin Skodinis |
| 2000 | How Helpers Hasten | Peter Sanders, Roberto Solis-Oba |
| 2000 | Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. | Naila Rahman, Rajeev Raman |
| 2000 | New Algorithms for Two-Label Point Labeling. | Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu |
| 2000 | Minimum Depth Graph Embedding. | Maurizio Pizzonia, Roberto Tamassia |
| 2000 | Maintaining a Minimum Spanning Tree Under Transient Node Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 2000 | On the Competitiveness of Linear Search. | J. Ian Munro |
| 2000 | Resource Constrained Shortest Paths. | Kurt Mehlhorn, Mark Ziegelmann |
| 2000 | Computational Biology - Algorithms and More. | Thomas Lengauer |
| 2000 | Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. | Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa |
| 2000 | Jitter Regulation in an Internet Router with Delay Consideration. | Hisashi Koga |
| 2000 | Scheduling Broadcasts in Wireless Networks. | Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai |
| 2000 | Simpler and Faster Vertex-Connectivity Augmentation Algorithms. | Tsan-sheng Hsu |
| 2000 | Preemptive Scheduling with Rejection. | Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger |
| 2000 | Minimizing a Convex Cost Closure Set. | Dorit S. Hochbaum, Maurice Queyranne |
| 2000 | Web Information Retrieval - an Algorithmic Perspective. | Monika Henzinger |
| 2000 | On Representations of Algebraic-Geometric Codes for List Decoding. | Venkatesan Guruswami, Madhu Sudan |