{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:29Z","timestamp":1725914669814},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_3","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"32-44","source":"Crossref","is-referenced-by-count":1,"title":["Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard"],"prefix":"10.1007","author":[{"given":"Akanksha","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[]},{"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"3_CR1","unstructured":"Addis, B., Di Summa, M., Grosso, A.: Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth. Optimization online (2011). www.optimization-online.org"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-11269-0_4","volume-title":"Parameterized and Exact Computation","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Lokshtanov, D., Penninkx, E.: Planar capacitated dominating set is W[1]-hard. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 50\u201360. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-11269-0_4"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"12","key":"3_CR4","doi-asserted-by":"crossref","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M Summa Di","year":"2011","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12), 1766\u20131774 (2011)","journal-title":"Comput. Oper. Res."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn., vol. 173. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1997). doi: 10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"3_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). doi: 10.1007\/3-540-29953-X"},{"issue":"1","key":"3_CR8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.jctb.2008.06.004","volume":"99","author":"M Grohe","year":"2009","unstructured":"Grohe, M., Marx, D.: On tree width, bramble size, and expansion. J. Comb. Theory Ser. B 99(1), 218\u2013228 (2009)","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2016.08.018","volume":"651","author":"D Hermelin","year":"2016","unstructured":"Hermelin, D., Kaspi, M., Komusiewicz, C., Navon, B.: Parameterized complexity of critical node cuts. Theoret. Comput. Sci. 651, 62\u201375 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.4086\/toc.2010.v006a005","volume":"6","author":"D Marx","year":"2010","unstructured":"Marx, D.: Can you beat treewidth? Theory Comput. 6(1), 85\u2013112 (2010)","journal-title":"Theory Comput."},{"key":"3_CR11","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"11","key":"3_CR12","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca, M.: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput. Oper. Res. 39(11), 2763\u20132775 (2012)","journal-title":"Comput. Oper. Res."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.cor.2013.09.012","volume":"43","author":"M Ventresca","year":"2014","unstructured":"Ventresca, M., Aleman, D.: A derandomized approximation algorithm for the critical node detection problem. Comput. Oper. Res. 43, 261\u2013270 (2014)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T12:11:15Z","timestamp":1570277475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}