default search action
ALENEX 2009: New York City, NY, USA
- Irene Finocchi, John Hershberger:
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009. SIAM 2009, ISBN 978-0-898719-30-7 - Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms. 1-13 - Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat:
Solving Maximum Flow Problems on Real World Bipartite Graphs. 14-28 - Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio:
Tuning BNDM with q-Grams. 29-37 - Frans Schalekamp, Anke van Zuylen:
Rank Aggregation: Together We're Strong. 38-51 - Vitaly Osipov, Peter Sanders, Johannes Singler:
The Filter-Kruskal Minimum Spanning Tree Algorithm. 52-61 - Joseph S. B. Mitchell:
Algorithmic Problems in Air Traffic Management. 62 - Herman J. Haverkort, Freek van Walderveen:
Four-Dimensional Hilbert Curves for R-Trees. 63-73 - Taras Galkovsky, Bernd Gärtner, Bogdan Rublev:
The Domination Heuristic for LP-type Problems. 74-84 - Ulrich Meyer, Vitaly Osipov:
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. 85-96 - Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter:
Time-Dependent Contraction Hierarchies. 97-105 - Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten:
Drawing Binary Tanglegrams: An Experimental Evaluation. 106-119 - Siamak Tazari, Matthias Müller-Hannemann:
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. 120-131 - Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing. 132-144 - Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. 145-153 - Matthias Hagen, Peter Horatschek, Martin Mundhenk:
Experimental comparison of the two Fredman-Khachiyan-algorithms. 154-161 - Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. 162-174
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.