Demian Hespe

24 papers A 4B 3C 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.
Algorithmica
Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2024 B conf
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI.
SPAA
Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl
2024 A conf
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI.
SC
Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders
2024 J jnl
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI.
CoRR
Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl
2024 J jnl
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.
CoRR
Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2024 J jnl
Scalable Fault-Tolerant MapReduce.
CoRR
Demian Hespe, Lukas Hübner, Charel Mercatoris, Peter Sanders
2024 B conf
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks.
SEA
Kenneth Langedal, Demian Hespe, Peter Sanders
2023 — —
Enabling Scalability: Graph Hierarchies and Fault Tolerance.
Demian Hespe
2023 A conf
Pareto Sums of Pareto Sets.
ESA
Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2022 — conf
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.
FTXS@SC
Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis
2022 J jnl
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.
CoRR
Demian Hespe, Lukas Hübner, Peter Sanders, Alexandros Stamatakis
2021 J jnl
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG.
Bioinform.
Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis
2021 B conf
Targeted Branching for the Maximum Independent Set Problem.
SEA
Demian Hespe, Sebastian Lamm, Christian Schorr
2021 J jnl
Targeted Branching for the Maximum Independent Set Problem.
CoRR
Demian Hespe, Sebastian Lamm, Christian Schorr
2020 A conf
Engineering Kernelization for Maximum Cut.
ALENEX
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
2020 — conf
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.
CSC
Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
2019 J jnl
Engineering Kernelization for Maximum Cut.
CoRR
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
2019 C conf
More Hierarchy in Route Planning Using Edge Hierarchies.
ATMOS
Demian Hespe, Peter Sanders
2019 J jnl
More Hierarchy in Route Planning Using Edge Hierarchies.
CoRR
Demian Hespe, Peter Sanders
2019 J jnl
Scalable Kernelization for Maximum Independent Sets.
ACM J. Exp. Algorithmics
Demian Hespe, Christian Schulz, Darren Strash
2019 J jnl
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track.
CoRR
Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
2018 A conf
Scalable Kernelization for Maximum Independent Sets.
ALENEX
Demian Hespe, Christian Schulz, Darren Strash
2017 J jnl
Fast OLAP Query Execution in Main Memory on Large Data in a Cluster.
CoRR
Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders
2017 J jnl
Scalable Kernelization for Maximum Independent Sets.
CoRR
Demian Hespe, Christian Schulz, Darren Strash