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