scientific article; zbMATH DE number 5764786
From MaRDI portal
Publication:3579375
Cited in
(26)- Parameterized complexity of vertex deletion into perfect graph classes
- scientific article; zbMATH DE number 7471674 (Why is no real title available?)
- All minor-minimal apex obstructions with connectivity two
- A polynomial excluded-minor approximation of treedepth
- A basic parameterized complexity primer
- Graph minors and parameterized algorithm design
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Fixed-parameter tractable distances to sparse graph classes
- Faster parameterized algorithms for modification problems to minor-closed classes
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- A more accurate view of the flat wall theorem
- Minor-obstructions for apex sub-unicyclic graphs
- A survey of parameterized algorithms and the complexity of edge modification
- Chordal deletion is fixed-parameter tractable
- Obtaining a planar graph by vertex deletion
- Minor obstructions for apex-pseudoforests
- Confronting intractability via parameters
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Faster parameterized algorithms for minor containment
- Sparse obstructions for minor-covering parameters
- Minor-obstructions for apex sub-unicyclic graphs
- Combing a Linkage in an Annulus
- A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
- Hitting forbidden minors: approximation and kernelization
- Block elimination distance
- Block elimination distance
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579375)
