| 2003 | Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries. Ranjan Sinha, Justin Zobel |
| 2003 | Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim |
| 2003 | Efficient Exact Geometric Predicates for Delauny Triangulations. Olivier Devillers, Sylvain Pion |
| 2003 | Fast Prefix Matching of Bounded Strings. Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang |
| 2003 | Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. John Hershberger, Matthew Maxel, Subhash Suri |
| 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 | Interpolation over Light Fields with Applications in Computer Graphics. F. Betül Atalay, David M. Mount |
| 2003 | On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. Mauricio G. C. Resende, Renato Fonseca F. Werneck |
| 2003 | Open Problems from ALENEX 2003. Erik D. Demaine |
| 2003 | Practical Constraction of Metric t-Spanners. Gonzalo Navarro, Rodrigo Paredes |
| 2003 | Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003 Richard E. Ladner |
| 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 | The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. Christos Gkantsidis, Milena Mihail, Ellen W. Zegura |
| 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 |