Faster Reachability in Static Graphs. - Kathrin Hanauer; Christian Schulz 003; Jonathan Trummer (CoRR, 2020)

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (INFOCOM, 2022)

O'Reach: Even Faster Reachability in Large Graphs. - Kathrin Hanauer; Christian Schulz 003; Jonathan Trummer (ACM J. Exp. Algorithmics, 2022)

DJ-Match/DJ-Match: Version 1.0.0. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (Zenodo, 2022)