Pages that link to "Item:Q2849356"
From MaRDI portal
The following pages link to Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q2849356):
Displaying 13 items.
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- Greedy domination on biclique-free graphs (Q1730031) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- (Q3304124) (← links)
- (Q5090497) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- On the parameterized complexity of compact set packing (Q6623598) (← links)
