Pages that link to "Item:Q5146828"
From MaRDI portal
The following pages link to A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828):
Displaying 14 items.
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- (Q5874519) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- (Q6068237) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
