Parameterized complexity of vertex deletion into perfect graph classes

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

doi:10.1007/978-3-642-22953-4_21

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 proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings
Editors	Olaf Owe, Martin Steffen, Jan Arne Telle
Publisher	Springer
Pages	240-251
Number of pages	12
ISBN (Electronic)	978-3-642-22953-4
ISBN (Print)	978-3-642-22952-7
DOIs	https://doi.org/10.1007/978-3-642-22953-4_21
Publication status	Published - 2011
Externally published	Yes
Event	18th International Symposium on Fundamentals of Computation Theory, FCT 2011 - Oslo, Norway Duration: 22 Aug 2011 → 25 Aug 2011 Conference number: 18

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	6914

Conference

Conference	18th International Symposium on Fundamentals of Computation Theory, FCT 2011
Abbreviated title	FCT 2011
Country/Territory	Norway
City	Oslo
Period	22/08/11 → 25/08/11

Access to Document

10.1007/978-3-642-22953-4_21

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. https://doi.org/10.1007/978-3-642-22953-4_21

Heggernes, Pinar ; van 't Hof, Pim ; Jansen, Bart M. P. et al. / Parameterized complexity of vertex deletion into perfect graph classes. Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. editor / Olaf Owe ; Martin Steffen ; Jan Arne Telle. Springer, 2011. pp. 240-251 (Lecture Notes in Computer Science).

@inproceedings{f78edfbdcdc74b4283e26737e7b733f8,

title = "Parameterized complexity of vertex deletion into perfect graph classes",

author = "Pinar Heggernes and {van 't Hof}, Pim and Jansen, {Bart M. P.} and Stefan Kratsch and Yngve Villanger",

year = "2011",

doi = "10.1007/978-3-642-22953-4_21",

language = "English",

isbn = "978-3-642-22952-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "240--251",

editor = "Olaf Owe and Martin Steffen and Telle, {Jan Arne}",

booktitle = "Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings",

address = "Germany",

note = "18th International Symposium on Fundamentals of Computation Theory, FCT 2011, FCT 2011 ; Conference date: 22-08-2011 Through 25-08-2011",

}

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

Parameterized complexity of vertex deletion into perfect graph classes. / Heggernes, Pinar; van 't Hof, Pim; Jansen, Bart M. P. et al.
Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. ed. / Olaf Owe; Martin Steffen; Jan Arne Telle. Springer, 2011. p. 240-251 (Lecture Notes in Computer Science; Vol. 6914).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Parameterized complexity of vertex deletion into perfect graph classes

AU - Heggernes, Pinar

AU - van 't Hof, Pim

AU - Jansen, Bart M. P.

AU - Kratsch, Stefan

AU - Villanger, Yngve

N1 - Conference code: 18

PY - 2011

Y1 - 2011

U2 - 10.1007/978-3-642-22953-4_21

DO - 10.1007/978-3-642-22953-4_21

M3 - Conference contribution

SN - 978-3-642-22952-7

T3 - Lecture Notes in Computer Science

SP - 240

EP - 251

BT - Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings

A2 - Owe, Olaf

A2 - Steffen, Martin

A2 - Telle, Jan Arne

PB - Springer

T2 - 18th International Symposium on Fundamentals of Computation Theory, FCT 2011

Y2 - 22 August 2011 through 25 August 2011

ER -

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