ALENEX 2003:
Baltimore,
MD,
USA
Richard E. Ladner (Ed.):
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003.
SIAM 2003, ISBN 0-89871-542-3 
- Lars Arge:
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk).
- Erik D. Demaine:
Open Problems from ALENEX 2003.
- David Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor:
The Cutting-Stock Approach to Bin Packing: Theory and Experiments.
1-15
- Christos Gkantsidis, Milena Mihail, Ellen W. Zegura:
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs.
16-25
- John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation.
26-36
- Olivier Devillers, Sylvain Pion:
Efficient Exact Geometric Predicates for Delauny Triangulations.
37-44
- Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions.
45-55
- F. Betul Atalay, David M. Mount:
Interpolation over Light Fields with Applications in Computer Graphics.
56-68
- Gonzalo Navarro, Rodrigo Paredes:
Practical Constraction of Metric t-Spanners.
69-81
- Lars Arge, Andrew Danner, Sha-Mayn Teh:
I/O-efficient Point Location Using Persistent B-Trees.
82-92
- Ranjan Sinha, Justin Zobel:
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries.
93-105
- Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer:
Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations.
106-118
- Mauricio G. C. Resende, Renato Fonseca F. Werneck:
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
119-127
- Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
Fast Prefix Matching of Bounded Strings.
128-140
Copyright © Fri Nov 27 19:30:56 2009
by Michael Ley (ley@uni-trier.de)
