ALENEX A

17 papers

YearTitle / Authors
2012An Experimental and Analytical Study of Order Constraints for Single Machine Scheduling with Quadratic Cost.
Wiebke Höhn, Tobias Jacobs
2012Clique Cover on Sparse Networks.
Mathieu Blanchette, Ethan Kim, Adrian Vetta
2012Computing a Consensus of Multilabeled Trees.
Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki
2012Distributed Evolutionary Graph Partitioning.
Peter Sanders, Christian Schulz
2012Evaluation of an MSO-Solver.
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012Exact Combinatorial Branch-and-Bound for Graph Bisection.
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2012Experiments on Density-Constrained Graph Clustering.
Robert Görke, Andrea Schumm, Dorothea Wagner
2012Fast Compressed Tries through Path Decompositions.
Giuseppe Ottaviano, Roberto Grossi
2012Hierarchical Heavy Hitters with the Space Saving Algorithm.
Justin Thaler, Michael Mitzenmacher, Thomas Steinke
2012Leveling the Grid.
Sabine Cornelsen, Andreas Karrenbauer, Shujun Li
2012Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012
David A. Bader, Petra Mutzel
2012Robust Mobile Route Planning with Limited Connectivity.
Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck
2012Round-Based Public Transit Routing.
Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck
2012Solving the Minimum String Cover Problem.
Stefan Canzar, Tobias Marschall, Sven Rahmann, Chris Schwiegelshohn
2012The Complexity of Partial Orders.
J. Ian Munro
2012Transit Nodes - Lower Bounds and Refined Construction.
Jochen Eisner, Stefan Funke
2012User-Constrained Multi-Modal Route Planning.
Julian Dibbelt, Thomas Pajor, Dorothea Wagner