The following pages link to (Q4598163):
Displaying 13 items.
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q2849356) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- (Q5002788) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)