Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
type: Item
instance of: scholarly article
title: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
zbMATH Open document ID: 1342.68165
DOI: 10.1007/978-3-642-22953-4_21
author: Pinar Heggernes
author: Pim Van 't Hof
author: Bart M. P. Jansen
author: Stefan Kratsch
author: Yngve Villanger
published in: Fundamentals of Computation Theory
publication date: 2011-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5940779
MaRDI profile type: Publication
full work available at URL: 978-3-642-22953-4 21
OpenAlex ID: W32464776
cites work: A kernelization algorithm for \(d\)-hitting set
cites work: On Problems without Polynomial Kernels (Extended Abstract)
cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths
cites work: A cubic kernel for feedback vertex set and loop cutset
cites work: (Meta) Kernelization
cites work: Graph Classes: A Survey
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Improved upper bounds for vertex cover
cites work: The strong perfect graph theorem
cites work: Incompressibility through Colors and IDs
cites work: Q3113683
cites work: Algorithmic graph theory and perfect graphs
cites work: Iterative Compression for Exactly Solving NP-Hard Minimization Problems
cites work: Isomorphism for Graphs of Bounded Feedback Vertex Set Number
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Wheel-Free Deletion Is W[2]-Hard
cites work: Chordal deletion is fixed-parameter tractable
cites work: Obtaining a Planar Graph by Vertex Deletion
cites work: A Problem Kernelization for Graph Packing
cites work: Finding odd cycle transversals.
cites work: A 4 k 2 kernel for feedback vertex set
description: scientific article