Demian Hespe

According to our database, Demian Hespe authored at least 15 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.

Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel

CoRR, 2024

KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI.

Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl

CoRR, 2024

Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks.

Kenneth Langedal, Demian Hespe, Peter Sanders

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI.

Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023

Enabling Scalability: Graph Hierarchies and Fault Tolerance.

Demian Hespe

PhD thesis, 2023

Pareto Sums of Pareto Sets.

Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.

Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis

Proceedings of the 12th IEEE/ACM Workshop on Fault Tolerance for HPC at eXtreme Scale, 2022

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

Bioinform., November, 2021

Targeted Branching for the Maximum Independent Set Problem.

Demian Hespe, Sebastian Lamm, Christian Schorr

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Engineering Kernelization for Maximum Cut.

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

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Scalable Kernelization for Maximum Independent Sets.

Demian Hespe, Christian Schulz, Darren Strash

ACM J. Exp. Algorithmics, 2019

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

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

CoRR, 2019

More Hierarchy in Route Planning Using Edge Hierarchies.

Demian Hespe, Peter Sanders

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2017

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

Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders

CoRR, 2017