Abstract is missing.
- An Experimental Study of Minimum Mean Cycle AlgorithmsLoukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck. 1-13 [doi]
- Solving Maximum Flow Problems on Real World Bipartite GraphsCosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat. 14-28 [doi]
- Tuning BNDM with q-GramsBranislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio. 29-37 [doi]
- Rank Aggregation: Together We re StrongFrans Schalekamp, Anke van Zuylen. 38-51 [doi]
- The Filter-Kruskal Minimum Spanning Tree AlgorithmVitaly Osipov, Peter Sanders, Johannes Singler. 52-61 [doi]
- Algorithmic Problems in Air Traffic ManagementJoseph S. B. Mitchell. 62 [doi]
- Four-Dimensional Hilbert Curves for R-TreesHerman J. Haverkort, Freek van Walderveen. 63-73 [doi]
- The Domination Heuristic for LP-type ProblemsTaras Galkovsky, Bernd Gärtner, Bogdan Rublev. 74-84 [doi]
- Design and Implementation of a Practical I/O-efficient Shortest Paths AlgorithmUlrich Meyer, Vitaly Osipov. 85-96 [doi]
- Time-Dependent Contraction HierarchiesGernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter. 97-105 [doi]
- Drawing Binary Tanglegrams: An Experimental EvaluationMartin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten. 106-119 [doi]
- Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTASSiamak Tazari, Matthias Müller-Hannemann. 120-131 [doi]
- Theory and Practise of Monotone Minimal Perfect HashingDjamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. 132-144 [doi]
- Quasirandom Rumor Spreading: An Experimental AnalysisBenjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald. 145-153 [doi]
- Experimental comparison of the two Fredman-Khachiyan-algorithmsMatthias Hagen, Peter Horatschek, Martin Mundhenk. 154-161 [doi]
- Randomized Rounding in the Presence of a Cardinality ConstraintBenjamin Doerr, Magnus Wahlström. 162-174 [doi]