Software
KaMIS - Karlsruhe Maximum Independent Sets
WeGotYouCovered - The Vertex Cover Solver that won the PACE 2019 challenge
ParFastKer - Fast and parallel kernelization for Independent Sets
DMAX - Data Reduction for Maximum Cut
| Title | Author(s) | Source | Date |
|---|---|---|---|
| ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms | Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis |
January 2023 | |
| Exploring Parallel MPI Fault Tolerance Mechanisms for Phylogenetic Inference with RAxML-NG | Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis |
January 2021 | |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track | Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash |
August 2019 | |
| Targeted Branching for the Maximum Independent Set Problem | Demian Hespe, Sebastian Lamm, Christian Schorr |
February 2021 | |
| Fast OLAP Query Execution in Main Memory on Large Data in a Cluster | Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders |
September 2017 | |
| More Hierarchy in Route Planning Using Edge Hierarchies | Demian Hespe, Peter Sanders |
July 2019 | |
| Scalable Kernelization for the Maximum Independent Set Problem | Demian Hespe, Christian Schulz, Darren Strash |
August 2017 | |
| Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
May 2019 |
| Title | Conference | Date |
|---|---|---|
| Fundamental Graph Algorithms | KSETA Topical Course |
March 2020 |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track | CSC 2020 |
February 2020 |
| More Hierarchy in Route Planning Using Edge Hierarchies | ATMOS 2019 |
September 2019 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track (Poster) | IPEC 2019 |
September 2019 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track (Talk) | IPEC 2019 |
September 2019 |
| Practical Kernelization Techniques for the Maximum Cut Problem | The Indo-German Workshop / Spring School on Algorithms for Big Data |
February 2019 |
| Scalable Kernelization for Maximum Independent Sets | ALENEX 2018 |
January 2018 |
| Scalable Kernelization for Maximum Independent Sets | The German-Israeli Workshop / Winter School on Algorithms for Big Data |
November 2017 |
| Title | Type | Semester |
|---|---|---|
| Seminar: Algorithm Engineering | Seminar (S) | WS 22/23 |
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Lab course | SS 2021 |
| Parallele Algorithmen | Vorlesung (V) | WS 20/21 |
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Lab course | SS 2020 |
| Parallele Algorithmen | Vorlesung (V) | WS 19/20 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2019 |
| Algorithmen II | Vorlesung (V) | WS 18/19 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2018 |
| Algorithmen II | Vorlesung (V) | WS 17/18 |
| Algorithm Engineering | Vorlesung (V) | SS 2017 |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Scalable Decentralized Fault-Tolerant MapReduce for Iterative Algorithms | Fault-Tolerance | Demian Hespe, Lukas Hübner, Peter Sanders |
Charel Mercatoris |
| Improved Branching Strategies for Maximum Independent Sets | Kernelization | Demian Hespe, Sebastian Lamm, Peter Sanders |
Christian Schorr |
| Load-Balance and Fault-Tolerance for Massively Parallel Phylogenetic Inference | Fault Tolerance | Alexandros Stamatakis, Peter Sanders, Alexey Kozlov, Demian Hespe |
Lukas Hübner |
| A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem | Kernelization | Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Damir Ferizovic |
| Distributed Kernelization for Independent Sets | Distributed Graph Algorithms | Peter Sanders, Demian Hespe, Sebastian Lamm |
Tom George |