Petr A. Golovach, Jan KratochvÃl, Ondrej Suchý. Parameterized Complexity of Generalized Domination Problems. In Christophe Paul, Michel Habib, editors, Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Volume 5911 of Lecture Notes in Computer Science, pages 133-142, 2009. [doi]
@inproceedings{GolovachKS09,
title = {Parameterized Complexity of Generalized Domination Problems},
author = {Petr A. Golovach and Jan KratochvÃl and Ondrej Suchý},
year = {2009},
doi = {10.1007/978-3-642-11409-0_12},
url = {http://dx.doi.org/10.1007/978-3-642-11409-0_12},
researchr = {https://researchr.org/publication/GolovachKS09},
cites = {0},
citedby = {0},
pages = {133-142},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
editor = {Christophe Paul and Michel Habib},
volume = {5911},
series = {Lecture Notes in Computer Science},
isbn = {978-3-642-11408-3},
}