Pages that link to "Item:Q5145014"
From MaRDI portal
The following pages link to An exponential time parameterized algorithm for planar disjoint paths (Q5145014):
Displaying 8 items.
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220) (← links)
- Finding <i>k</i> Disjoint Paths in a Directed Planar Graph (Q4305357) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)