\textsc{Planar} F-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
From MaRDI portal
Publication:6988198
Cited in
(18)- An FPT-algorithm for recognizing k-apices of minor-closed graph classes
- When recursion is better than iteration: a linear-time algorithm for directed acyclicity with few error vertices
- Kernelization dichotomies for hitting subgraphs under structural parameterizations
- Bicriteria \textsf{FPT}-approximation algorithms for vertex deletion to bounded degeneracy graphs
- Approximate Turing kernelization for problems parameterized by treewidth
- Kernelization of counting problems
- Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
- An improved kernelization algorithm for trivially perfect editing
- Approximately interpolating between uniformly and non-uniformly polynomial kernels
- FPT approximations for packing and covering problems parameterized by elimination distance and even less
- Search-space reduction via essential vertices
- Polynomial kernel for immersion hitting in tournaments
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
- Compound logics for modification problems
- Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
- Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
- Outer-planar vertex deletion on AT-free graphs
- Graph modification of bounded size to minor-closed classes as fast as vertex deletion
This page was built for publication: \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988198)
