The following pages link to (Q3579485):
Displayed 7 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)