@InProceedings{chitnis_et_al:LIPIcs.FSTTCS.2013.79,
author = {Chitnis, Rajesh and Fomin, Fedor V. and Golovach, Petr A.},
title = {{Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages = {79--90},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-64-4},
ISSN = {1868-8969},
year = {2013},
volume = {24},
editor = {Seth, Anil and Vishnoi, Nisheeth K.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.79},
URN = {urn:nbn:de:0030-drops-43636},
doi = {10.4230/LIPIcs.FSTTCS.2013.79},
annote = {Keywords: Parameterized complexity, directed graphs, anchored \$k\$-core}
}