| 2003 | Practical Constraction of Metric t-Spanners. | Gonzalo Navarro, Rodrigo Paredes |
| 2003 | Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. | Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim |
| 2003 | Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. | John Hershberger, Matthew Maxel, Subhash Suri |
| 2003 | The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. | Christos Gkantsidis, Milena Mihail, Ellen W. Zegura |
| 2003 | Efficient Exact Geometric Predicates for Delauny Triangulations. | Olivier Devillers, Sylvain Pion |
| 2003 | Open Problems from ALENEX 2003. | Erik D. Demaine |
| 2003 | Fast Prefix Matching of Bounded Strings. | Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang |
| 2003 | Interpolation over Light Fields with Applications in Computer Graphics. | F. Betl Atalay, David M. Mount |
| 2003 | I/O-efficient Point Location Using Persistent B-Trees. | Lars Arge, Andrew Danner, Sha-Mayn Teh |
| 2003 | Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). | Lars Arge |
| 2003 | The Cutting-Stock Approach to Bin Packing: Theory and Experiments. | David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor |
| 2003 | Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. | Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer |
| 2002 | Using Multi-level Graphs for Timetable Information in Railway Systems. | Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2002 | Topological Sweep in Degenerate Cases. | Eynat Rafalin, Diane L. Souvaine, Ileana Streinu |
| 2002 | Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. | Kirk Pruhs, Eric Wiewiora |
| 2002 | STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. | Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled |
| 2002 | Acceleration of K-Means and Related Clustering Algorithms. | Steven J. Phillips |
| 2002 | A Time-Sensitive System for Black-Box Combinatorial Optimization. | Vinhthuy T. Phan, Pavel Sumazin, Steven Skiena |
| 2002 | Experimental Evaluation of a New Shortest Path Algorithm. | Seth Pettie, Vijaya Ramachandran, Srinath Sridhar |
| 2002 | A Compressed Breadth-First Search for Satisfiability. | DoRon B. Motter, Igor L. Markov |
| 2002 | The Treewidth of Java Programs. | Jens Gustedt, Ole A. Mhle, Jan Arne Telle |
| 2002 | An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. | Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti |
| 2002 | An Improvement on Tree Selection Sort. | Jingchao Chen |
| 2002 | Getting More from Out-of-Core Columnsort. | Geeta Chaudhry, Thomas H. Cormen |
| 2002 | Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. | Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano |