3. WAE 1999: London, UK
Jeffrey Scott Vitter, Christos D. Zaroliagis (Eds.): Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings. Springer 1999 Lecture Notes in Computer Science ISBN 3-540-66427-0
Invited Lectures
Andrew V. Goldberg: Selecting Problems for Algorithm Evaluation. 1-11
William F. McColl: BSP Algorithms - Write Once, Run Anywhere. 12-13
Kurt Mehlhorn: Ten Years of LEDA Some Thoughts (Abstract). 14
Contributed Papers
Víctor M. Jiménez, Andrés Marzal: Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. 15-29
Shlomit Dascal, Uzi Vishkin: Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. 43-59
Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição: Finding Minimum Congestion Spanning Trees. 60-71
Dimitris J. Kavvadias, Elias C. Stavropoulos: Evaluation of an Algorithm for the Transversal Hypergraph Problem. 72-84
Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction Heuristics and Domination Analysis for the Asymmetric TSP. 85-94
Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas: Counting in Mobile Networks: Theory and Experimentation. 95-109
Frank Schulz, Dorothea Wagner, Karsten Weihe: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. 110-123
Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura: Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. 124-138
Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart: On-Line Zone Construction in Arrangements of Lines in the Plane. 139-153
Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan: The Design and Implementation of Planar Maps in CGAL. 154-168
Jochen Comes, Mark Ziegelmann: An Easy to Use Implementation of Linear Perturbations within CGAL. 169-182
Maureen Korda, Rajeev Raman: An Experimental Evaluation of Hybrid Data Structures for Searching. 214-228
Michael L. Fredman: A Priority Queue Transform. 244-258
Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis: Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. 259-271
Daniel H. Huson, Kelly Ann Smith, Tandy Warnow: Estimating Large Distances in Phylogenetic Reconstruction. 272-286
Sabine Hanke: The Performance of Concurrent Red-Black Tree Algorithms. 287-301
Jesper Bojesen, Jyrki Katajainen, Maz Spork: Performance Engineering Case Study: Heap Construction. 302-316
Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof: BALL: Biochemical Algorithms Library. 331-345
Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. 346-360



