Dr. Demian Hespe
- Herr Dr. Hespe hat unser Institut inzwischen verlassen.
- hespe ∂does-not-exist.kit edu
- github.com/Hespian
Software
KaMIS - Karlsruhe Maximum Independent Sets
WeGotYouCovered - Der "Vertex Cover"-Löser, der den PACE 2019 Wettbewerb gewann
ParFastKer - Schnelle und parallele Problemkern-Reduktion für "Independent Sets"
DMAX - Problemkern-Reduktion für "Maximum Cut"
| Titel | Autoren | Quelle | Datum |
|---|---|---|---|
| ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms | Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis |
Januar 2023 | |
| Targeted Branching for the Maximum Independent Set Problem | Demian Hespe, Sebastian Lamm, Christian Schorr |
Februar 2021 | |
| Exploring Parallel MPI Fault Tolerance Mechanisms for Phylogenetic Inference with RAxML-NG | Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis |
Januar 2021 | |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track | Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash |
August 2019 | |
| More Hierarchy in Route Planning Using Edge Hierarchies | Demian Hespe, Peter Sanders |
Juli 2019 | |
| Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Mai 2019 | |
| Fast OLAP Query Execution in Main Memory on Large Data in a Cluster | Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders |
September 2017 | |
| Scalable Kernelization for the Maximum Independent Set Problem | Demian Hespe, Christian Schulz, Darren Strash |
August 2017 |
| Titel | Tagung | Datum |
|---|---|---|
| Fundamental Graph Algorithms | KSETA Topical Course |
März 2020 |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track | CSC 2020 |
Februar 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 (Vortrag) | IPEC 2019 |
September 2019 |
| Practical Kernelization Techniques for the Maximum Cut Problem | The Indo-German Workshop / Spring School on Algorithms for Big Data |
Februar 2019 |
| Scalable Kernelization for Maximum Independent Sets | ALENEX 2018 |
Januar 2018 |
| Scalable Kernelization for Maximum Independent Sets | The German-Israeli Workshop / Winter School on Algorithms for Big Data |
November 2017 |
| Titel | Typ | Semester |
|---|---|---|
| Seminar: Algorithm Engineering | Seminar (S) | WS 22/23 |
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Praktikum | SS 2021 |
| Parallele Algorithmen | Vorlesung (V) | WS 20/21 |
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Praktikum | 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 |