Pages that link to "Item:Q3132873"
From MaRDI portal
The following pages link to Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (Q3132873):
Displaying 8 items.
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- (Q4993296) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- (Q5111863) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
