Parameterized complexity of vertex deletion into perfect graph classes

This publication has 21 references indexed in Scilit:

• Kernel bounds for disjoint cycles and disjoint paths
  Theoretical Computer Science, 2011
• Obtaining a Planar Graph by Vertex Deletion
  Algorithmica, 2011
• Improved upper bounds for vertex cover
  Theoretical Computer Science, 2010
• A 4 k ² kernel for feedback vertex set
  ACM Transactions on Algorithms, 2010
• Chordal Deletion is Fixed-Parameter Tractable
  Algorithmica, 2008
• Invitation to data reduction and problem kernelization
  ACM SIGACT News, 2007
• The strong perfect graph theorem
  Annals of Mathematics, 2006
• Finding odd cycle transversals
  Operations Research Letters, 2004
• Parameterized complexity of finding subgraphs with hereditary properties
  Theoretical Computer Science, 2002
• Fixed-parameter tractability of graph modification problems for hereditary properties
  Information Processing Letters, 1996