CUFinder

Demian Hespe

About Demian Hespe

Demian Hespe, With an exceptional h-index of 4 and a recent h-index of 4 (since 2020), a distinguished researcher at Karlsruher Institut für Technologie, specializes in the field of Algorithm Engineering, Distributed Algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

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

Pareto Sums of Pareto Sets

Restore: In-memory replicated storage for rapid recovery in fault-tolerant algorithms

Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG

Targeted Branching for the Maximum Independent Set Problem

Scalable discrete algorithms for big data applications

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

Engineering kernelization for maximum cut

Demian Hespe Information

University

Position

___

Citations(all)

110

Citations(since 2020)

109

Cited By

49

hIndex(all)

4

hIndex(since 2020)

4

i10Index(all)

3

i10Index(since 2020)

3

Email

University Profile Page

Google Scholar

Demian Hespe Skills & Research Interests

Algorithm Engineering

Distributed Algorithms

Top articles of Demian Hespe

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

arXiv preprint arXiv:2404.05610

2024/4/8

Demian Hespe
Demian Hespe

H-Index: 3

Florian Kurpicz
Florian Kurpicz

H-Index: 6

Peter Sanders
Peter Sanders

H-Index: 45

Daniel Seemaier
Daniel Seemaier

H-Index: 2

Pareto Sums of Pareto Sets

2023

Demian Hespe
Demian Hespe

H-Index: 3

Peter Sanders
Peter Sanders

H-Index: 45

Sabine Storandt
Sabine Storandt

H-Index: 14

Restore: In-memory replicated storage for rapid recovery in fault-tolerant algorithms

2022/11/13

Demian Hespe
Demian Hespe

H-Index: 3

Peter Sanders
Peter Sanders

H-Index: 45

Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG

Bioinformatics

2021/11/15

Demian Hespe
Demian Hespe

H-Index: 3

Peter Sanders
Peter Sanders

H-Index: 45

Targeted Branching for the Maximum Independent Set Problem

arXiv preprint arXiv:2102.01540

2021/2/2

Demian Hespe
Demian Hespe

H-Index: 3

Sebastian Lamm
Sebastian Lamm

H-Index: 8

Scalable discrete algorithms for big data applications

2021/1/1

Demian Hespe
Demian Hespe

H-Index: 3

Lorenz Hübschle-Schneider
Lorenz Hübschle-Schneider

H-Index: 4

Peter Sanders
Peter Sanders

H-Index: 45

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

2020

Demian Hespe
Demian Hespe

H-Index: 3

Sebastian Lamm
Sebastian Lamm

H-Index: 8

Christian Schulz
Christian Schulz

H-Index: 20

Darren Strash
Darren Strash

H-Index: 14

Engineering kernelization for maximum cut

2020

Demian Hespe
Demian Hespe

H-Index: 3

Sebastian Lamm
Sebastian Lamm

H-Index: 8

Christian Schulz
Christian Schulz

H-Index: 20

Darren Strash
Darren Strash

H-Index: 14

See List of Professors in Demian Hespe University(Karlsruher Institut für Technologie)