Similar Items: Designing sparse temporal graphs satisfying connectivity requirements
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Temporal Routing in Static Networks: The Schedule Completion Problem