Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Uhl, T. N.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 289–291, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660260 

KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Stelz, C.; Uhl, T. N.
2024. arxiv. doi:10.48550/arXiv.2404.05610 

Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076 

Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. doi:10.48550/arXiv.2302.11443 

Communication Efficient Triangle Counting. Masterarbeit
Uhl, T. N.
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150358  

Faster and better nested dissection orders for Customizable Contraction Hierarchies
Gottesbüren, L.; Hamann, M.; Uhl, T. N.; Wagner, D.
2019. Algorithms, 12 (9), Art.-Nr.: 196. doi:10.3390/a12090196