Pinar Heggernes, Pim van t Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger. Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. In Olaf Owe, Martin Steffen, Jan Arne Telle, editors, Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Volume 6914 of Lecture Notes in Computer Science, pages 240-251, Springer, 2011. [doi]
@inproceedings{HeggernesHJKV11,
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 = {2011},
doi = {10.1007/978-3-642-22953-4_21},
url = {http://dx.doi.org/10.1007/978-3-642-22953-4_21},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HeggernesHJKV11},
cites = {0},
citedby = {0},
pages = {240-251},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
editor = {Olaf Owe and Martin Steffen and Jan Arne Telle},
volume = {6914},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22952-7},
}