Pages that link to "Item:Q5009462"
From MaRDI portal
The following pages link to A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth (Q5009462):
Displaying 5 items.
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)