- Route Planning
- Kernelization
- Graph Algorithms
- Fault Tolerance
![]() |
![]() M.Sc. Demian Hespe |
|
Room: 210 Phone: +49 721 608-45270 Fax: +49 721 608-43088 hespeSsn6∂kit edu |
|
Research Interests
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
Publications
Hespe, D.; Sanders, P.
2019. 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019), München, 12.-13. September 2019, 10:1–10:14. doi:10.4230/OASIcs.ATMOS.2019.10
Hespe, D.; Schulz, C.; Strash, D.
2019. Journal of experimental algorithmics, 24 (1), Article: 1.16. doi:10.1145/3355502
Hespe, D.; Schulz, C.; Strash, D.
2018. ALENEX18 : Proceedings of the 20th Meeting on Algorithm Engineering & Experiments, New Orleans, Louisiana, USA, 7th - 8th January 2018. Ed.: R. Pagh, 223–237, Society for Industrial and Applied Mathematics Publications. doi:10.1137/1.9781611975055.19
Title | Author(s) | Source | Date |
---|---|---|---|
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 |
July 2019 | |
Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
May 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 |
Title | Conference | Date |
---|---|---|
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 |
Teaching
Title | Type | Semester |
---|---|---|
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 |
---|---|---|
Kernelization for Independent Sets | Kernelization | Demian Hespe, Sebastian Lamm |
Title | Subject | Supervisor | Student |
---|---|---|---|
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 |