Fast OLAP Query Execution in Main Memory on Large Data in a Cluster. - Demian Hespe; Martin Weidner; Jonathan Dees; Peter Sanders 001 (CoRR, 2017)

More Hierarchy in Route Planning Using Edge Hierarchies. - Demian Hespe; Peter Sanders 001 (ATMOS, 2019)

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CoRR, 2019)

Scalable Kernelization for Maximum Independent Sets. - Demian Hespe; Christian Schulz 003; Darren Strash (ACM J. Exp. Algorithmics, 2019)

Engineering Kernelization for Maximum Cut. - Damir Ferizovic; Demian Hespe; Sebastian Lamm; Matthias Mnich; Christian Schulz 003; Darren Strash (ALENEX, 2020)

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CSC, 2020)

Targeted Branching for the Maximum Independent Set Problem. - Demian Hespe; Sebastian Lamm; Christian Schorr (SEA, 2021)

Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG. - Lukas Hübner; Alexey M. Kozlov; Demian Hespe; Peter Sanders 001; Alexandros Stamatakis (Bioinform., 2021)

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. - Lukas Hübner; Demian Hespe; Peter Sanders 001; Alexandros Stamatakis (FTXS@SC, 2022)

Pareto Sums of Pareto Sets. - Demian Hespe; Peter Sanders 001; Sabine Storandt; Carina Truschel (ESA, 2023)

Enabling Scalability: Graph Hierarchies and Fault Tolerance. - Demian Hespe (2023)

KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI. - Tim Niklas Uhl; Matthias Schimek; Lukas Hübner; Demian Hespe; Florian Kurpicz; Daniel Seemaier; Christoph Stelz; Peter Sanders 001 (SC, 2024)

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. - Demian Hespe; Lukas Hübner; Florian Kurpicz; Peter Sanders 001; Matthias Schimek; Daniel Seemaier; Tim Niklas Uhl (SPAA, 2024)

Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. - Kenneth Langedal; Demian Hespe; Peter Sanders 001 (SEA, 2024)

Scalable Fault-Tolerant MapReduce. - Demian Hespe; Lukas Hübner; Charel Mercatoris; Peter Sanders 001 (CoRR, 2024)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. - Daniel Funke; Demian Hespe; Peter Sanders 001; Sabine Storandt; Carina Truschel (Algorithmica, 2025)