2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order. PDF file names represent the Proceedings (ALX and year 09), followed by order in printed version (e.g. 001) and first author's first initial and last name. ISBN: 978-0-898719-30-7
1 An Experimental Study of Minimum Mean Cycle Algorithms
Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan, and Renato F. Werneck
14 Solving Maximum Flow Problems on Real World Bipartite Graphs
Cosmin Silvestru Negruşeri, Mircea Bogdan Paşoi, Barbara Stanley, Clifford Stein, and Cristian George Strat
29 Tuning BNDM with q-Grams
Branislav Ďurian, Jan Holub, Hannu Peltola, and Jorma Tarhio
38 Rank Aggregation: Together We're Strong
Frans Schalekamp and Anke van Zuylen
52 The Filter-Kruskal Minimum Spanning Tree Algorithm
Vitaly Osipov, Peter Sanders, and Johannes Singler
62 Algorithmic Problems in Air Traffic Management
Joseph S. B. Mitchell
63 Four-Dimensional Hilbert Curves for R-Trees
Herman Haverkort and Freek van Walderveen
74 The Domination Heuristic for LP-type Problems
Taras Galkovsky, Bernd Gärtner, and Bogdan Rublev
85 Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
Ulrich Meyer and Vitaly Osipov
97 Time-Dependent Contraction Heirarchies
G. Veit Batz, Daniel Delling, Peter Sanders, and Christian Vetter
106 Drawing Binary Tanglegrams: An Experimental Evaluation
Martin Nöllenburg, Markus Völker, Alexander Wolff, and Danny Holten
120 Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS
Siamak Tazari and Matthias Müller-Hannemann
132 Theory and Practise of Monotone Minimal Perfect Hashing
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, and Sebastiano Vigna
145 Quasirandom Rumor Spreading: An Experimental Analysis
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
154 Experimental comparison of the two Fredman-Khachiyan-algorithms
Matthias Hagen, Peter Horatschek, and Martin Mundhenk
162 Randomized Rounding in the Presence of a Cardinality Constraint
Benjamin Doerr and Magnus Wahlström
