default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDemian Hespe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders:
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI. SC 2024: 44- [c9]Demian Hespe
, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl:
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. SPAA 2024: 289-291 - [c8]Kenneth Langedal, Demian Hespe, Peter Sanders:
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. SEA 2024: 20:1-20:21 - [i10]Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl:
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI. CoRR abs/2404.05610 (2024) - [i9]Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. CoRR abs/2409.10232 (2024) - [i8]Demian Hespe, Lukas Hübner, Charel Mercatoris, Peter Sanders:
Scalable Fault-Tolerant MapReduce. CoRR abs/2411.16255 (2024) - 2023
- [b1]Demian Hespe:
Enabling Scalability: Graph Hierarchies and Fault Tolerance. Karlsruhe Institute of Technology, Germany, 2023 - [c7]Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets. ESA 2023: 60:1-60:17 - 2022
- [c6]Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis:
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. FTXS@SC 2022: 24-35 - [i7]Demian Hespe, Lukas Hübner, Peter Sanders, Alexandros Stamatakis:
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. CoRR abs/2203.01107 (2022) - 2021
- [j2]Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis:
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG. Bioinform. 37(22): 4056-4063 (2021) - [c5]Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. SEA 2021: 17:1-17:21 - [i6]Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. CoRR abs/2102.01540 (2021) - 2020
- [c4]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - [c3]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC 2020: 1-11
2010 – 2019
- 2019
- [j1]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ACM J. Exp. Algorithmics 24(1): 1.16:1-1.16:22 (2019) - [c2]Demian Hespe, Peter Sanders:
More Hierarchy in Route Planning Using Edge Hierarchies. ATMOS 2019: 10:1-10:14 - [i5]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. CoRR abs/1905.10902 (2019) - [i4]Demian Hespe, Peter Sanders:
More Hierarchy in Route Planning Using Edge Hierarchies. CoRR abs/1907.03535 (2019) - [i3]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. CoRR abs/1908.06795 (2019) - 2018
- [c1]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ALENEX 2018: 223-237 - 2017
- [i2]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. CoRR abs/1708.06151 (2017) - [i1]Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders:
Fast OLAP Query Execution in Main Memory on Large Data in a Cluster. CoRR abs/1709.05183 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
