scientific article; zbMATH DE number 5764786
From MaRDI portal
Publication:3579375
Cited in
(35)- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Minor obstructions for apex-pseudoforests
- A polynomial excluded-minor approximation of treedepth
- Sparse obstructions for minor-covering parameters
- All minor-minimal apex obstructions with connectivity two
- Fixed-parameter tractable distances to sparse graph classes
- Obtaining a planar graph by vertex deletion
- Hitting forbidden minors: approximation and kernelization
- A basic parameterized complexity primer
- Graph minors and parameterized algorithm design
- Parameterized complexity of vertex deletion into perfect graph classes
- Confronting intractability via parameters
- A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
- On supergraphs satisfying CMSO properties
- Block elimination distance
- Block elimination distance
- k-apices of minor-closed graph classes. I: Bounding the obstructions
- Combing a Linkage in an Annulus
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- A survey of parameterized algorithms and the complexity of edge modification
- Faster parameterized algorithms for minor containment
- Faster parameterized algorithms for modification problems to minor-closed classes
- A more accurate view of the flat wall theorem
- Minor-obstructions for apex sub-unicyclic graphs
- An FPT-algorithm for recognizing k-apices of minor-closed graph classes
- Graph parameters, universal obstructions, and WQO
- Decremental sensitivity oracles for covering and packing minors
- Expressiveness results for an inductive logic of separated relations
- Compound logics for modification problems
- An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
- Hitting meets packing: how hard can it be?
- Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
- An overview of universal obstructions for graph parameters
- Minor-obstructions for apex sub-unicyclic graphs
- Chordal deletion is fixed-parameter tractable
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)
