An FPT-algorithm for recognizing k-apices of minor-closed graph classes
From MaRDI portal
An FPT-algorithm for recognizing \(k\)-apices of minor-closed graph classes
Cites work
- \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
- A c^k n 5-approximation algorithm for treewidth
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A faster parameterized algorithm for pseudoforest deletion
- A near-optimal planarization algorithm
- A new proof of the flat wall theorem
- An improved algorithm for finding tree decompositions of small width
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Bidimensional Parameters and Local Treewidth
- Contractibility and NP-completeness
- Data-compression for parametrized counting problems on sparse graphs
- Deleting vertices to graphs of bounded genus
- Faster deterministic \textsc{Feedback Vertex Set}
- Faster parameterized algorithms for minor containment
- Finding odd cycle transversals.
- Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3--5, 2015. Proceedings
- Fundamentals of parameterized complexity
- Graph minors and parameterized algorithm design
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Hitting and harvesting pumpkins
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved upper bounds for vertex cover
- Linear kernels and single-exponential algorithms via protrusion decompositions
- Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
- Lower bound of the Hadwiger number of graphs by their average degree
- Modification to Planarity is Fixed Parameter Tractable
- Nonconstructive tools for proving polynomial-time decidability
- Obtaining a planar graph by vertex deletion
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Parameterized algorithms
- Parametrized complexity theory.
- Planarity Allowing Few Error Vertices in Linear Time
- The complexity of induced minors and related problems
- The disjoint paths problem in quadratic time
- The extremal function for complete minors
- The node-deletion problem for hereditary properties is NP-complete
- Uniform kernelization complexity of hitting forbidden minors
- Wheel-Free Deletion Is W[2]-Hard
- Which problems have strongly exponential complexity?
This page was built for publication: An FPT-algorithm for recognizing \(k\)-apices of minor-closed graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842476)
