{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:31:35Z","timestamp":1758270695051,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,5,8]],"date-time":"2017-05-08T00:00:00Z","timestamp":1494201600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["267959","306992"],"award-info":[{"award-number":["267959","306992"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006475","name":"Bergen Research Foundation","doi-asserted-by":"crossref","award":["BeHard"],"award-info":[{"award-number":["BeHard"]}],"id":[{"id":"10.13039\/501100006475","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00453-017-0317-1","type":"journal-article","created":{"date-parts":[[2017,5,8]],"date-time":"2017-05-08T10:03:20Z","timestamp":1494237800000},"page":"271-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quick but Odd Growth of Cacti"],"prefix":"10.1007","volume":"79","author":[{"given":"Sudeshna","family":"Kolay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,8]]},"reference":[{"issue":"2","key":"317_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/103516.103517","volume":"38","author":"EM Arkin","year":"1991","unstructured":"Arkin, E.M., Papadimitriou, C.H., Yannakakis, M.: Modularity of cycles and paths in graphs. J. ACM 38(2), 255\u2013274 (1991)","journal-title":"J. ACM"},{"key":"317_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A Becker","year":"2000","unstructured":"Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. JAIR 12, 219\u2013234 (2000)","journal-title":"JAIR"},{"doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS 2009, pp. 629\u2013638 (2009)","key":"317_CR3","DOI":"10.1109\/FOCS.2009.46"},{"doi-asserted-by":"crossref","unstructured":"Cao, Y.: Unit interval editing is fixed-parameter tractable. In: ICALP 2015, volume 9134 of LNCS, pp 306\u2013317. Springer (2015)","key":"317_CR4","DOI":"10.1007\/978-3-662-47672-7_25"},{"issue":"3","key":"317_CR5","first-page":"21:1","volume":"11","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Trans. Algorithms 11(3), 21:1\u201321:35 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"317_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D\u00e1niel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"317_CR7","volume-title":"Graph Theory, Volume 173, Graduate Texts in Mathematics","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory, Volume 173, Graduate Texts in Mathematics, 4th edn. Springer, Berlin (2012)","edition":"4"},{"key":"317_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity. Texts in Computer Science","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)"},{"doi-asserted-by":"crossref","unstructured":"Fiorini, S., Joret, G., Pietropaoli, U.: Hitting diamonds and growing cacti. In: IPCO 2010, volume 9682 of LNCS, pp. 191\u2013204 (2010)","key":"317_CR9","DOI":"10.1007\/978-3-642-13036-6_15"},{"issue":"1","key":"317_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/140997889","volume":"30","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: approximation and kernelization. SIAM J. Discrete Math. 30(1), 383\u2013410 (2016)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: FOCS 2012, pp. 470\u2013479 (2012)","key":"317_CR11","DOI":"10.1109\/FOCS.2012.62"},{"issue":"6","key":"317_CR12","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1137\/11085390X","volume":"42","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. SIAM J. Comput. 42(6), 2197\u20132216 (2013)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniform kernelization complexity of hitting forbidden minors. In: ICALP 2015, volume 9134 of LNCS, pp. 629\u2013641. Springer (2015)","key":"317_CR13","DOI":"10.1007\/978-3-662-47672-7_51"},{"issue":"6","key":"317_CR14","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":"3","key":"317_CR15","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, St\u00e9phan: Hitting and harvesting pumpkins. SIAM J. Discrete Math. 28(3), 1363\u20131390 (2014)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","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: ICALP 2013, volume 7965 of LNCS, pp. 613\u2013624. Springer (2013)","key":"317_CR16","DOI":"10.1007\/978-3-642-39206-1_52"},{"issue":"1","key":"317_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.jcss.2014.05.001","volume":"81","author":"EJ Kim","year":"2015","unstructured":"Kim, E.J., Paul, C., Philip, G.: A single-exponential FPT algorithm for the $${K}_{\\text{4 }}$$ K 4 -minor cover problem. J. Comput. Syst. Sci. 81(1), 186\u2013207 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"317_CR18","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/net.3230140403","volume":"14","author":"AS LaPaugh","year":"1984","unstructured":"LaPaugh, A.S., Papadimitriou, C.H.: The even-path problem for graphs and digraphs. Networks 14(4), 507\u2013513 (1984)","journal-title":"Networks"},{"issue":"2","key":"317_CR19","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."},{"doi-asserted-by":"crossref","unstructured":"Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms for even cycle transversal. In: WG 2012, volume 7551 of LNCS, pp. 172\u2013183 (2012)","key":"317_CR20","DOI":"10.1007\/978-3-642-34611-8_19"},{"issue":"1","key":"317_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12(1), 101\u2013111 (1988)","journal-title":"J. Graph Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0317-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0317-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0317-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T16:27:02Z","timestamp":1569256022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0317-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0317-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,5,8]]}}}