ALENEX A

15 papers

YearTitle / Authors
2016A General Framework for Dynamic Succinct and Compressed Data Structures.
Patrick Klitzke, Patrick K. Nicholson
2016A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.
Ruben Becker, Maximilian Fickert, Andreas Karrenbauer
2016An Algorithm for Online K-Means Clustering.
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
2016An Empirical Comparison of Graph Laplacian Solvers.
Erik G. Boman, Kevin Deweese, John R. Gilbert
2016Computing Top-
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2016Engineering Oracles for Time-Dependent Road Networks.
Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2016Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks.
Fabian Fuchs
2016Fast Algorithms for Pseudoarboricity.
Markus Blumenstock
2016Finding Near-Optimal Independent Sets at Scale.
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016Generating Massive Scale-Free Networks under Resource Constraints.
Ulrich Meyer, Manuel Penschuck
2016Geometry Helps to Compare Persistence Diagrams.
Michael Kerber, Dmitriy Morozov, Arnur Nigmetov
2016Graph Bisection with Pareto-Optimization.
Michael Hamann, Ben Strasser
2016Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016
Michael T. Goodrich, Michael Mitzenmacher
2016Real-Time k-bounded Preemptive Scheduling.
Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir
2016Scalable Transfer Patterns.
Hannah Bast, Matthias Hertel, Sabine Storandt