WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track D Hespe, S Lamm, C Schulz, D Strash 2020 Proceedings of the SIAM Workshop on Combinatorial Scientific Computing …, 2020 | 62* | 2020 |
Scalable kernelization for maximum independent sets D Hespe, C Schulz, D Strash Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019 | 55 | 2019 |
Engineering kernelization for maximum cut D Ferizovic, D Hespe, S Lamm, M Mnich, C Schulz, D Strash 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020 | 22 | 2020 |
More Hierarchy in Route Planning Using Edge Hierarchies D Hespe, P Sanders 19th Symposium on Algorithmic Approaches for Transportation Modelling …, 2019 | 7 | 2019 |
Targeted Branching for the Maximum Independent Set Problem D Hespe, S Lamm, C Schorr arXiv preprint arXiv:2102.01540, 2021 | 6 | 2021 |
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG L Hübner, AM Kozlov, D Hespe, P Sanders, A Stamatakis Bioinformatics 37 (22), 4056-4063, 2021 | 5 | 2021 |
Kamping: Flexible and (near) zero-overhead c++ bindings for mpi TN Uhl, M Schimek, L Hübner, D Hespe, F Kurpicz, C Stelz, P Sanders arXiv preprint arXiv:2404.05610, 2024 | 3 | 2024 |
Pareto Sums of Pareto Sets D Hespe, P Sanders, S Storandt, C Truschel 31st Annual European Symposium on Algorithms (ESA 2023), 2023 | 3 | 2023 |
Pareto sums of pareto sets: Lower bounds and algorithms D Funke, D Hespe, P Sanders, S Storandt, C Truschel arXiv preprint arXiv:2409.10232, 2024 | 2 | 2024 |
Brief announcement:(near) zero-overhead C++ bindings for MPI D Hespe, L Hübner, F Kurpicz, P Sanders, M Schimek, D Seemaier, ... Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024 | 2 | 2024 |
Enabling Scalability: Graph Hierarchies and Fault Tolerance D Hespe Karlsruhe Institute of Technology, Germany, 2023 | 1 | 2023 |
Scalable Fault-Tolerant MapReduce D Hespe, L Hübner, C Mercatoris, P Sanders arXiv preprint arXiv:2411.16255, 2024 | | 2024 |
KIT–ITI Algorithm Engineering–Studium und Lehre-Lehrveranstaltungen-Algorithmen II HP Lehmann Hans-Peter Lehmann, 2024 | | 2024 |
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks K Langedal, D Hespe, P Sanders 22nd International Symposium on Experimental Algorithms (SEA 2024), 20: 1-20: 21, 2024 | | 2024 |
Restore: In-memory replicated storage for rapid recovery in fault-tolerant algorithms L Hübner, D Hespe, P Sanders, A Stamatakis 2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale …, 2022 | | 2022 |
Scalable discrete algorithms for big data applications D Hespe, L Hübner, L Hübschle-Schneider, P Sanders, D Schreiber International Conference on High Performance Computing in Science and …, 2021 | | 2021 |
Fast OLAP Query Execution in Main Memory on Large Data in a Cluster D Hespe, M Weidner, J Dees, P Sanders arXiv preprint arXiv:1709.05183, 2017 | | 2017 |
Communication Efficient Algorithms for Distributed OLAP Query Execution D Hespe, DIJ Dees, MSM Weidner Karlsruher Institut für Technologie (KIT), 2014 | | 2014 |
Algorithmen II P Sanders, T Bingmann, S Lamm, D Hespe | | |