@InProceedings{hermelin_et_al:LIPIcs.IPEC.2015.343,
author = {Hermelin, Danny and Kaspi, Moshe and Komusiewicz, Christian and Navon, Barak},
title = {{Parameterized Complexity of Critical Node Cuts}},
booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)},
pages = {343--354},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-92-7},
ISSN = {1868-8969},
year = {2015},
volume = {43},
editor = {Husfeldt, Thore and Kanj, Iyad},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.343},
URN = {urn:nbn:de:0030-drops-55950},
doi = {10.4230/LIPIcs.IPEC.2015.343},
annote = {Keywords: graph cut problem, NP-hard problem, treewidth}
}