Demian Hespe

Orcid: 0000-0001-6232-2951

According to our database1, Demian Hespe authored at least 11 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Enabling Scalability: Graph Hierarchies and Fault Tolerance.
PhD thesis, 2023

Pareto Sums of Pareto Sets.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.
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.
Bioinform., November, 2021

Targeted Branching for the Maximum Independent Set Problem.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Engineering Kernelization for Maximum Cut.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Scalable Kernelization for Maximum Independent Sets.
ACM J. Exp. Algorithmics, 2019

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

More Hierarchy in Route Planning Using Edge Hierarchies.
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.
CoRR, 2017


  Loading...