Similar Items: Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
- Convex Optimization with Nested Evolving Feasible Sets
- Simpler and Improved Replacement Path Coverings
- Designing Capacitated Subnetworks for Shortest Path Routing
- A Separator for Minor-Free Graphs Beyond the Flow Barrier
- Small Independent Sets versus Small Separator in Geometric Intersection Graphs
- Undirected Replacement Paths: Dual Fault Reduces to Single Source