Abstract is missing.
- Algorithm Engineering for Parallel ComputationDavid A. Bader, Bernard M. E. Moret, Peter Sanders. 1-23 [doi]
- Visualization in Algorithm Engineering: Tools and TechniquesCamil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher. 24-50 [doi]
- Parameterized Complexity: The Main Ideas and Connections to Practical ComputingMichael R. Fellows. 51-77 [doi]
- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program InstrumentationRichard E. Ladner, Ray Fortna, Bao-Hoang Nguyen. 78-92 [doi]
- Using Finite Experiments to Study Asymptotic PerformanceCatherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup. 93-126 [doi]
- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram AlgorithmsChristoph Meinel, Harald Sack, Arno Wagner. 127-138 [doi]
- Algorithms and Heuristics in VLSI DesignChristoph Meinel, Christian Stangier. 139-162 [doi]
- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental AlgorithmicsBernard M. E. Moret, Tandy Warnow. 163-180 [doi]
- Presenting Data from Experiments in AlgorithmicsPeter Sanders. 181-196 [doi]
- Distributed Algorithm EngineeringPaul G. Spirakis, Christos D. Zaroliagis. 197-228 [doi]
- Implementations and Experimental Studies of Dynamic Graph AlgorithmsChristos D. Zaroliagis. 229-278 [doi]