| 2005 | The Minimum-Area Spanning Tree Problem. | Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell |
| 2005 | Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. | Gerth Stlting Brodal, Gabriel Moruz |
| 2005 | Towards a Theory of Algorithms. | Allan Borodin |
| 2005 | Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. | Markus Blser, L. Shankar Ram, Maxim Sviridenko |
| 2005 | Derandomization of Dimensionality Reduction and SDP Based Algorithms. | Ankur Bhargava, S. Rao Kosaraju |
| 2005 | On the Vehicle Routing Problem. | Piotr Berman, Surajit K. Das |
| 2005 | Approximating the Online Set Multicover Problems via Randomized Winnowing. | Piotr Berman, Bhaskar DasGupta |
| 2005 | Linear Time Algorithms for Generalized Edge Dominating Set Problems. | Andr Berger, Ojas Parekh |
| 2005 | Communication-Aware Processor Allocation for Supercomputers. | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sndor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
| 2005 | Subquadratic Algorithms for 3SUM. | Ilya Baran, Erik D. Demaine, Mihai Patrascu |
| 2005 | The On-line Asymmetric Traveling Salesman Problem. | Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura |
| 2005 | Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. | Giora Alexandron, Haim Kaplan, Micha Sharir |
| 2005 | Succinct Representation of Triangulations with a Boundary. | Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer |
| 2003 | Fast Relative Approximation of Potential Fields. | Martin Ziegler |
| 2003 | Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs. | Huaming Zhang, Xin He |
| 2003 | Algorithms and Models for Railway Optimization. | Dorothea Wagner |
| 2003 | Alternating Paths along Orthogonal Segments. | Csaba D. Tth |
| 2003 | Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content. | Jijun Tang, Bernard M. E. Moret |
| 2003 | Smoothed Analysis (Motivation and Discrete Models). | Daniel A. Spielman, Shang-Hua Teng |
| 2003 | Sorting Circular Permutations by Reversal. . | Andrew Solomon, Paul J. Sutcliffe, Raymond Lister |
| 2003 | Fast Algorithms for a Class of Temporal Range Queries. | Qingmin Shi, Joseph F. JJ |
| 2003 | Extremal Configurations and Levels in Pseudoline Arrangements. | Micha Sharir, Shakhar Smorodinsky |
| 2003 | Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection. | Sudipta Sengupta |
| 2003 | Parameterized Complexity of Directed Feedback Set Problems in Tournaments. | Venkatesh Raman, Saket Saurabh |
| 2003 | Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. | Elena Prieto-Rodriguez, Christian Sloper |