ALENEX Program Schedule
January 3, 2009
New York Marriott Downtown, New York, New York
An Experimental Study of Minimum Cycle Mean Algorithms
Loukas Georgiadis, Andrew Goldberg, Robert E. Tarjan and Renato WerneckSolving Maximum Flow Problems on Real World Bipartite Graphs
Silvestru Negruseri, Mircea Pasoi, Cliff Stein, Barbara Stanley and Cristian Strat
Tuning BNDM with q-Grams
Branislav Durian, Jan Holub, Hannu Peltola and Jorma Tarhio
Rank Aggregation: Together We're Strong
Anke van Zuylen and Frans Schalekamp
The Filter-Kruskal Minimum Spanning Tree Algorithm
Vitaly Osipov, Peter Sanders and Johannes Singler
ALENEX Invited Plenary Speaker
Algorithmic Problems in Air Traffic
Joseph S.B. Mitchell, State University of New York at Stony Brook
ANALCO Invited Plenary Speaker
Mathematics and Computer Science Serving/impacting Bioinformatics
Gaston Gonnet, ETH Zürich, Switzerland
Four-Dimensional Hilbert Curves for R-Trees
Herman Haverkort and Freek van Walderveen
The Domination Heuristic for LP-type Problems
Taras Galkovskyi, Bernd Gärtner and Bogdan Rublev
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
Ulrich Meyer and Vitaly Osipov
Time-Dependent Contraction Hierarchies
G. Veit Batz, Daniel Delling and Peter Sanders
Drawing Binary Tanglegrams: An Experimental Evaluation
Martin Nöllenburg, Markus Voelker, Alexander Wolff and Danny Holten
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS
Siamak Tazari and Matthias Müller -Hannemann
Theory and Practise of Monotone Minimal Perfect Hashing
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh and Sebastiano Vigna
Quasirandom Rumor Spreading: An Experimental Analysis
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann and Thomas Sauerwald
Experimental comparison of the two Fredman-Khachiyan-algorithms
Matthias Hagen, Peter Horatschek and Martin Mundhenk
Randomized Rounding in the Presence of a Cardinality Constraint
Benjamin Doerr and Magnus Wahlström