{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:10:24Z","timestamp":1758269424457,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_20","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"233-244","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property"],"prefix":"10.1007","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[]},{"given":"Nick","family":"Brettell","sequence":"additional","affiliation":[]},{"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-49529-2_1","volume-title":"LATIN 2016: Theoretical Informatics","author":"A Agrawal","year":"2016","unstructured":"Agrawal, A., Kolay, S., Lokshtanov, D., Saurabh, S.: A faster FPT algorithm and a smaller kernel for block graph vertex deletion. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 1\u201313. Springer, Heidelberg (2016)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Proc. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Proc. Lett."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-13075-0_23","volume-title":"Algorithms and Computation","author":"PG Drange","year":"2014","unstructured":"Drange, P.G., Dregi, M.S., Hof, P.: On the computational complexity of vertex integrity and component order connectivity. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 285\u2013297. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-13075-0_23"},{"issue":"3","key":"20_CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"ES El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 35(3), 354\u2013362 (1988)","journal-title":"IEEE Trans. Circ. Syst."},{"issue":"4","key":"20_CR5","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1137\/S0097539798340047","volume":"30","author":"G Even","year":"2000","unstructured":"Even, G., Naor, J., Zosin, L.: An $$8$$ -approximation algorithm for the subset feedback vertex set problem. SIAM J. Comput. 30(4), 1231\u20131252 (2000)","journal-title":"SIAM J. Comput."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F., Lokshtanov, D., Misra, N., Saurabh, S.: Planar $$\\cal F$$ -deletion: approximation and optimal FPT algorithms. In: Foundations of Computer Science (FOCS), pp. 470\u2013479 (2012)","DOI":"10.1109\/FOCS.2012.62"},{"issue":"6","key":"20_CR7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"4","key":"20_CR8","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"20_CR9","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1137\/120883736","volume":"28","author":"G Joret","year":"2014","unstructured":"Joret, G., Paul, C., Sau, I., Saurabh, S., Thomass\u00e9, S.: Hitting and harvesting pumpkins. SIAM J. Discrete Math. 28(3), 1363\u20131390 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR10","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"270","volume-title":"10th International Symposium on Parameterized and Exact Computation (ipec 2015)","author":"EJ Kim","year":"2015","unstructured":"Kim, E.J., Kwon, O.: A polynomial kernel for block graph deletion. In: Husfeldt, T., Kanj, I. (eds.) IPEC 2015. Leibniz International Proceedings in Informatics (LIPIcs), vol. 43, pp. 270\u2013281. Schloss dagstuhl-leibniz-zentrum fuer informatik, Dagstuhl, Germany (2015)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-39206-1_52","volume-title":"Automata, Languages, and Programming","author":"EJ Kim","year":"2013","unstructured":"Kim, E.J., Langer, A., Paul, C., Reidl, F., Rossmanith, P., Sau, I., Sikdar, S.: Linear kernels and single-exponential algorithms via protrusion decompositions. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 613\u2013624. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39206-1_52"},{"issue":"10","key":"20_CR12","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.ipl.2014.05.001","volume":"114","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Proc. Lett. 114(10), 556\u2013560 (2014)","journal-title":"Inf. Proc. Lett."},{"key":"20_CR13","unstructured":"Kolay, S., Lokshtanov, D., Panolan, F., Saurabh, S.: Quick but odd growth of cacti. In: Husfeldt, T., Kanj, I. (eds.) 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), pp. 258\u2013269, no. 43. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2015)"},{"issue":"2","key":"20_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-642-34611-8_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Misra","year":"2012","unstructured":"Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms for Even Cycle Transversal. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 172\u2013183. Springer, Heidelberg (2012)"},{"issue":"4","key":"20_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4\u20136 January 2009, pp. 115\u2013119 (2009)","DOI":"10.1137\/1.9781611973068.13"},{"issue":"2","key":"20_CR18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/1721837.1721848","volume":"6","author":"S Thomass\u00e9","year":"2010","unstructured":"Thomass\u00e9, S.: A $$4k^2$$ kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 32 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Wahlstr\u00f6m, M.: Half-integrality, LP-branching and FPT algorithms. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1762\u20131781. SIAM (2014)","DOI":"10.1137\/1.9781611973402.128"}],"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-662-53536-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:01:49Z","timestamp":1568412109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}