Parameterized complexity of vertex deletion into perfect graph classes

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger. Parameterized complexity of vertex deletion into perfect graph classes. Theoretical Computer Science, 511:172-180, 2013. [doi]

@article{HeggernesHJKV13,
  title = {Parameterized complexity of vertex deletion into perfect graph classes},
  author = {Pinar Heggernes and Pim van 't Hof and Bart M. P. Jansen and Stefan Kratsch and Yngve Villanger},
  year = {2013},
  doi = {10.1016/j.tcs.2012.03.013},
  url = {http://dx.doi.org/10.1016/j.tcs.2012.03.013},
  researchr = {https://researchr.org/publication/HeggernesHJKV13},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {511},
  pages = {172-180},
}