Parameterized complexity of vertex deletion into perfect graph classes

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

32 Citations (Scopus)

102 Downloads (Pure)

Original language	English
Pages (from-to)	172-180
Number of pages	9
Journal	Theoretical computer science
Volume	511
Early online date	16 Mar 2012
DOIs	https://doi.org/10.1016/j.tcs.2012.03.013
Publication status	Published - 4 Nov 2013
Externally published	Yes

Access to Document

@article{d468e27e84ea4a8cb073346658a3fcdd,

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 = "2013",

month = nov,

day = "4",

doi = "10.1016/j.tcs.2012.03.013",

language = "English",

volume = "511",

pages = "172--180",

journal = "Theoretical computer science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

PY - 2013/11/4

Y1 - 2013/11/4

U2 - 10.1016/j.tcs.2012.03.013

DO - 10.1016/j.tcs.2012.03.013

M3 - Article

SN - 0304-3975

VL - 511

SP - 172

EP - 180

JO - Theoretical computer science

JF - Theoretical computer science

ER -