Dr. Demian Hespe

Research Interests

  • Route Planning
  • Kernelization
  • Graph Algorithms
  • Fault Tolerance

Software

Edge Hierarchies

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

Publications


Enabling Scalability: Graph Hierarchies and Fault Tolerance. PhD dissertation
Hespe, L. D.
2023, August 14. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000161317 Full textFull text of the publication as PDF document 
Pareto Sums of Pareto Sets
Hespe, D.; Sanders, P.; Storandt, S.; Truschel, C.
2023. I. L. Gørtz, M. Farach-Colton, S. J. Puglisi & G. Herman (Eds.), 31st Annual European Symposium on Algorithms (ESA 2023). Hrsg.: I. Li Gortz, M. Farach-Colton, S.J. Puglisi, G. Herman, 1–17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.60 Full textFull text of the publication as PDF document 
Scalable discrete algorithms for big data applications
Hespe, D.; Hübner, L.; Hübschle-Schneider, L.; Sanders, P.; Schreiber, D.
2023. High Performance Computing in Science and Engineering ’21 – Transactions of the High Performance Computing Center, Stuttgart (HLRS) 2021. Ed.: W. Nagel, 439–449, Springer International Publishing. doi:10.1007/978-3-031-17937-2_27 
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms
Hübner, L.; Hespe, D.; Sanders, P.; Stamatakis, A.
2022. 2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS), Dallas, TX, USA, 13-18 November 2022, 24–35, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/FTXS56515.2022.00008 Full textFull text of the publication as PDF document 
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG
Hübner, L.; Kozlov, A. M.; Hespe, D.; Sanders, P.; Stamatakis, A.
2021. Bioinformatics, 37 (22), 4056–4063. doi:10.1093/bioinformatics/btab399 Full textFull text of the publication as PDF document 
Targeted Branching for the Maximum Independent Set Problem
Hespe, D.; Lamm, S.; Schorr, C.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021). Hrsg.: D. Coudert, 17:1–17:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2021.17 Full textFull text of the publication as PDF document 
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track
Hespe, D.; Lamm, S.; Schulz, C.; Strash, D.
2020. SIAM Workshop on Combinatorial Scientific Computing (CSC20), Seattle, Washington, U.S., February 11 - 13, 2020. Ed.: H.M. Bücker, 1–11, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976229.1 
Engineering Kernelization for Maximum Cut
Ferizovic, D.; Hespe, D.; Lamm, S.; Mnich, M.; Schulz, C.; Strash, D.
2020. 2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, Utah, U.S., January 5 - 6, 2020. Ed.: G. Blelloch, 27–41, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976007.3 
Scalable Kernelization for Maximum Independent Sets
Hespe, D.; Schulz, C.; Strash, D.
2019. Journal of experimental algorithmics, 24 (1), Article: 1.16. doi:10.1145/3355502 Full textFull text of the publication as PDF document 
More Hierarchy in Route Planning Using Edge Hierarchies
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 
Scalable Kernelization for Maximum Independent Sets
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 (SIAM). doi:10.1137/1.9781611975055.19 
Technical Reports
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

arXiv:2203.01107

 January 2023
Targeted Branching for the Maximum Independent Set Problem

Demian Hespe, Sebastian Lamm, Christian Schorr

arXiv:2102.01540

 February 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

bioRxiv 2021.01.15.426773

 January 2021
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

arXiv:1908.06795

 August 2019
More Hierarchy in Route Planning Using Edge Hierarchies

Demian Hespe, Peter Sanders

arXiv:1907.03535

 July 2019
Engineering Kernelization for Maximum Cut

Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash

arXiv:1905.10902

 May 2019
Fast OLAP Query Execution in Main Memory on Large Data in a Cluster

Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders

arXiv:1709.05183

 September 2017
Scalable Kernelization for the Maximum Independent Set Problem

Demian Hespe, Christian Schulz, Darren Strash

arXiv:1708.06151

 August 2017

Teaching