Our research group addresses problems from parallel/distributed algorithm engineering.
We develop, analyze, implement, and evaluate algorithms. Our emphasis is on practical
graph algorithms with a theoretical foundation that scale to large data sets.
We currently focus on the following areas:
Algorithmic network analysis, in particular for large-scale dynamic scenarios
Combinatorial scientific computing, in particular graph partitioning and load balancing
Applied optimization, in particular for algorithmically hard problems in the (natural) sciences
Please note that our research group will leave UoC in the summer of 2018!
Our paper "Scalable Katz Ranking Computation in Large Dynamic Graphs"
co-authored with the Bader group at Georgia Tech was accepted at
Two papers on partitioning and mapping
(author set: Glantz, von Looz, Meyerhenke, Predari, Tzovas) were accepted at
Group members in January 2017 (f. l. t. r.):
Henning Meyerhenke, Ralf Kölmel, Roland Glantz, Eugenio Angriman,
Elisabetta Bergamini, Charilaos Tzovas, Moritz von Looz, Kolja Esders