The following pages link to (Q3579375):
Displaying 27 items.
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- All minor-minimal apex obstructions with connectivity two (Q2223478) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- (Q5009489) (← links)
- (Q5028434) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q6621238) (← links)
