Front matter
1-11
Selecting Problems for Algorithm Evaluation
Andrew V. Goldberg
12-13
BSP Algorithms — “Write Once, Run Anywhere”
Bill McColl
14
Ten Years of LEDA: Some Thoughts
Kurt Mehlhorn
15-29
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
Víctor M. Jiménez and Andrés Marzal
30-42
Efficient Implementation of Lazy Suffix Trees
Robert Giegerich, Stefan Kurtz and Jens Stoye
43-59
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism
Extended Abstract
Shlomit Dascal and Uzi Vishkin
60-71
Finding Minimum Congestion Spanning Trees
Renato Fonseca F. Werneck, João Carlos Setubal and Arlindo F. da Conceição
72-84
Evaluation of an Algorithm for the Transversal Hypergraph Problem
Dimitris J. Kavvadias and Elias C. Stavropoulos
85-94
Construction Heuristics and Domination Analysis for the Asymmetric TSP
Fred Glover, Gregory Gutin, Anders Yeo and Alexey Zverovich
95-109
Counting in Mobile Networks: Theory and Experimentation
K. Hatzis, G. Pentaris, P. Spirakis and B. Tampakas
110-123
Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
Frank Schulz, Dorothea Wagner and Karsten Weihe
124-138
Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
Panagiota Fatourou, Paul Spirakis, Panagiotis Zarafidis and Anna Zoura
139-153
On-Line Zone Construction in Arrangements of Lines in the Plane
Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled and Chaim Linhart
154-168
The Design and Implementation of Planar Maps in CGAL
Eyal Flato, Dan Halperin, Iddo Hanniel and Oren Nechushtan
169-182
An Easy to Use Implementation of Linear Perturbations within Cupgal
Jochen Comes and Mark Ziegelmann
183-197
Analysing Cache Effects in Distribution Sorting
Naila Rahman and Rajeev Raman
198-212
Fast Regular Expression Search
Gonzalo Navarro and Mathieu Raffinot
213-227
An Experimental Evaluation of Hybrid Data Structures for Searching
Maureen Korda and Rajeev Raman
228-242
LEDA-SM: Extending LEDA to Secondary Memory
Andreas Crauser and Kurt Mehlhorn
243-257
A Priority Queue Transform
Michael L. Fredman
258-270
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks
Athanasios Bouganis, Ioannis Caragiannis and Christos Kaklamanis
271-285
Estimating Large Distances in Phylogenetic Reconstruction
Daniel H. Huson, Kelly Ann Smith and Tandy J. Warnow
286-300
The Performance of Concurrent Red-Black Tree Algorithms
Sabine Hanke
301-315
Performance Engineering Case Study: Heap Construction
Jesper Bojesen, Jyrki Katajainen and Maz Spork
316-329
A Fast and Simple Local Search for Graph Coloring
Massimiliano Caramia and Paolo Dell’Olmo
330-344
BALL: Biochemical Algorithms Library
Nicolas Boghossian, Oliver Kohlbacher and Hans-Peter Lenhof
345-359
An Experimental Study of Priority Queues in External Memory
Klaus Brengel, Andreas Crauser, Paolo Ferragina and Ulrich Meyer
Back matter