Parameterized complexity of vertex deletion into perfect graph classes

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Citations (Scopus)
Original languageEnglish
Title of host publicationFundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings
EditorsOlaf Owe, Martin Steffen, Jan Arne Telle
PublisherSpringer Singapore
Pages240-251
Number of pages12
ISBN (Electronic)978-3-642-22953-4
ISBN (Print)978-3-642-22952-7
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event18th International Symposium on Fundamentals of Computation Theory, FCT 2011 - Oslo, Norway
Duration: 22 Aug 201125 Aug 2011
Conference number: 18

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6914

Conference

Conference18th International Symposium on Fundamentals of Computation Theory, FCT 2011
Abbreviated titleFCT 2011
CountryNorway
CityOslo
Period22/08/1125/08/11

Cite this

Heggernes, P., van 't Hof, P., Jansen, B. M. P., Kratsch, S., & Villanger, Y. (2011). Parameterized complexity of vertex deletion into perfect graph classes. In O. Owe, M. Steffen, & J. A. Telle (Eds.), Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings (pp. 240-251). (Lecture Notes in Computer Science; Vol. 6914). Springer Singapore. https://doi.org/10.1007/978-3-642-22953-4_21