Similar Items: Maximizing Reachability via Shifting of Temporal Paths
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- A Poisson Process for Submodular Maximization
- A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
- Simpler and Improved Replacement Path Coverings
- Designing Capacitated Subnetworks for Shortest Path Routing