Similar Items: Designing Capacitated Subnetworks for Shortest Path Routing
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Faster Algorithms for Shortest Unique or Absent Substrings
- Temporal Routing in Static Networks: The Schedule Completion Problem
- Simpler and Improved Replacement Path Coverings
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing