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
Our paper on computing many-to-many correspondences between partitions
(authors: Glantz, Meyerhenke) has been accepted
Congratulations to our group member Elisabetta Bergamini. She defended
her PhD thesis today and was awarded summa cum laude!
A warm welcome to our new group member Dr. Maria Predari.
Two papers accepted at ALENEX 2018!
The group starts today at UoC.
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