ALENEX A

16 papers

YearTitle / Authors
2015(Semi-)External Algorithms for Graph Partitioning and Clustering.
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
20152-Connectivity in Directed Graphs: An Experimental Study.
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015A Data-Aware FM-index.
Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu
2015An I/O-efficient Distance Oracle for Evolving Real-World Graphs.
Deepak Ajwani, Ulrich Meyer, David Veith
2015Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2015Approximating Betweenness Centrality in Large Evolving Networks.
Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt
2015Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover.
Takuya Akiba, Yoichi Iwata
2015Cache Replacement with Memory Allocation.
Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam
2015Computing MaxMin Edge Length Triangulations.
Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel
2015Engineering Motif Search for Large Graphs.
Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri
2015Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce.
Matteo Ceccarello, Francesco Silvestri
2015Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions.
Yuzuru Okajima, Kouichi Maruyama
2015Improved Single-Term Top-
Simon Gog, Gonzalo Navarro
2015Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015
Ulrik Brandes, David Eppstein
2015Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira
2015The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm.
Pierre Bertrand, Christoph Lenzen