Go to the corresponding LIPIcs Volume Portal 
Hermelin, Danny ; Kaspi, Moshe ; Komusiewicz, Christian ; Navon, Barak
pdfformat: 

@InProceedings{hermelin_et_al:LIPIcs:2015:5595, author = {Danny Hermelin and Moshe Kaspi and Christian Komusiewicz and Barak Navon}, title = {{Parameterized Complexity of Critical Node Cuts}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {343354}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897927}, ISSN = {18688969}, year = {2015}, volume = {43}, editor = {Thore Husfeldt and Iyad Kanj}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5595}, URN = {urn:nbn:de:0030drops55950}, doi = {10.4230/LIPIcs.IPEC.2015.343}, annote = {Keywords: graph cut problem, NPhard problem, treewidth} }
Keywords:  graph cut problem, NPhard problem, treewidth  
Collection:  10th International Symposium on Parameterized and Exact Computation (IPEC 2015)  
Issue Date:  2015  
Date of publication:  19.11.2015 