Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
From MaRDI portal
Publication:2093579
Recommendations
Cites work
- scientific article; zbMATH DE number 3547322 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- (Meta) kernelization
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A 4k^2 kernel for feedback vertex set
- A partial k-arboretum of graphs with bounded treewidth
- A quartic kernel for pathwidth-one vertex deletion
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
- Approximation and kernelization for chordal vertex deletion
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Characterizations of outerplanar graphs
- Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs
- Excluded-minor characterization of apex-outerplanar graphs
- Forbidden minors to graphs with small feedback sets
- Fundamentals of parameterized complexity
- Graph minors. V. Excluding a planar graph
- Heuristics for the maximum outerplanar subgraph problem
- Hitting forbidden minors: approximation and kernelization
- Kernelization. Theory of parameterized preprocessing
- Losing Treewidth by Separating Subsets
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Minimal cycle bases of outerplanar graphs
- Minor‐order obstructions for the graphs of vertex cover 6
- On computing graph minor obstruction sets
- Outerplanar obstructions for a feedback vertex set
- Parameterized algorithms
- Partitioning a graph into small pieces with applications to path transversal
- Pathwidth of outerplanar graphs
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Relaxations of graph isomorphism
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- The node-deletion problem for hereditary properties is NP-complete
- Upper bounds on the size of obstructions and intertwines
- Vertex cover: Further observations and further improvements
Cited in
(3)
This page was built for publication: Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093579)
