Parameterized complexity of vertex deletion into perfect graph classes
From MaRDI portal
Recommendations
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A cubic kernel for feedback vertex set and loop cutset
- A kernelization algorithm for \(d\)-hitting set
- Algorithmic graph theory and perfect graphs
- Chordal deletion is fixed-parameter tractable
- Finding odd cycle transversals.
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph Classes: A Survey
- Graph minors. XIII: The disjoint paths problem
- Hitting forbidden minors: approximation and kernelization
- Improved upper bounds for vertex cover
- Incompressibility through Colors and IDs
- Infeasibility of instance compression and succinct PCPs for NP
- Isomorphism for graphs of bounded feedback vertex set number
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Kernel bounds for disjoint cycles and disjoint paths
- Obtaining a planar graph by vertex deletion
- On problems without polynomial kernels
- Parameterized complexity of finding subgraphs with hereditary properties.
- The node-deletion problem for hereditary properties is NP-complete
- The strong perfect graph theorem
Cited in
(25)- Vertex deletion into bipartite permutation graphs
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- A polynomial kernel for 3-leaf power deletion
- Approximation and kernelization for chordal vertex deletion
- Parameterized complexity of deletion to scattered graph classes
- Search-space reduction via essential vertices
- Parameterized complexity of vertex deletion into perfect graph classes
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- A survey of parameterized algorithms and the complexity of edge modification
- Quadratic vertex kernel for split vertex deletion
- Structural parameterizations with modulator oblivion
- Vertex deletion into bipartite permutation graphs
- Structural parameterizations with modulator oblivion
- Distance from triviality 2.0: hybrid parameterizations
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- On the complexity of singly connected vertex deletion
- A completeness theory for polynomial (Turing) kernelization
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
This page was built for publication: Parameterized complexity of vertex deletion into perfect graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392038)
