10 citations · 13 across the 7 of their papers we have counts for
10 papers
Scalable Fault-Tolerant MapReduce
Demian Hespe, Lukas Hübner, Charel Mercatoris +1
Supercomputers getting ever larger and energy-efficient is at odds with the reliability of the used hardware. Thus, the time intervals between component failures are decreasing. Co…
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Daniel Funke, Demian Hespe, Peter Sanders +2
In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or…
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
Tim Niklas Uhl, Matthias Schimek, Lukas Hübner +4
The Message-Passing Interface (MPI) and C++ form the backbone of high-performance computing, but MPI only provides C and Fortran bindings. While this offers great language interope…
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms
Lukas Hübner, Demian Hespe, Peter Sanders +1
Fault-tolerant distributed applications require mechanisms to recover data lost via a process failure. On modern cluster systems it is typically impractical to request replacement…
Targeted Branching for the Maximum Independent Set Problem
Demian Hespe, Sebastian Lamm, Christian Schorr
Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinal…
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
Demian Hespe, Sebastian Lamm, Christian Schulz +1
We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelizatio…
More Hierarchy in Route Planning Using Edge Hierarchies
Demian Hespe, Peter Sanders
A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessin…
Engineering Kernelization for Maximum Cut
Damir Ferizovic, Demian Hespe, Sebastian Lamm +3
Kernelization is a general theoretical framework for preprocessing instances of NP-hard problems into (generally smaller) instances with bounded size, via the repeated application…
Fast OLAP Query Execution in Main Memory on Large Data in a Cluster
Demian Hespe, Martin Weidner, Jonathan Dees +1
Main memory column-stores have proven to be efficient for processing analytical queries. Still, there has been much less work in the context of clusters. Using only a single machin…
Scalable Kernelization for Maximum Independent Sets
Demian Hespe, Christian Schulz, Darren Strash
The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel. The ke…