Similar Items: Temporal Routing in Static Networks: The Schedule Completion Problem
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- Designing Capacitated Subnetworks for Shortest Path Routing
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
- Designing sparse temporal graphs satisfying connectivity requirements
- Towards Settling the Complexity of the Lettericity Problem