Abstract is missing.
- Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk)Lars Arge.
- Open Problems from ALENEX 2003Erik D. Demaine.
- The Cutting-Stock Approach to Bin Packing: Theory and ExperimentsDavid Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor. 1-15
- The Markov Chain Simulation Method for Generating Connected Power Law Random GraphsChristos Gkantsidis, Milena Mihail, Ellen W. Zegura. 16-25
- Finding the k Shortest Simple Paths: A New Algorithm and Its ImplementationJohn Hershberger, Matthew Maxel, Subhash Suri. 26-36
- Efficient Exact Geometric Predicates for Delauny TriangulationsOlivier Devillers, Sylvain Pion. 37-44
- Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High DimensionsPiyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim. 45-55
- Interpolation over Light Fields with Applications in Computer GraphicsF. Betul Atalay, David M. Mount. 56-68
- Practical Constraction of Metric t-SpannersGonzalo Navarro, Rodrigo Paredes. 69-81
- I/O-efficient Point Location Using Persistent B-TreesLars Arge, Andrew Danner, Sha-Mayn Teh. 82-92
- Cache-Conscious Sorting of Large Sets of Strings with Dynamic TriesRanjan Sinha, Justin Zobel. 93-105
- Train Routing Algorithms: Concepts, Design Choises, and Practical ConsiderationsLuzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer. 106-118
- On the Implemention of a Swap-Based Local Search Procedure for the p-Median ProblemMauricio G. C. Resende, Renato Fonseca F. Werneck. 119-127
- Fast Prefix Matching of Bounded StringsAdam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang. 128-140