{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144549,"version":"3.54.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_3","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:47Z","timestamp":1780780487000},"page":"32-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms for Edge Deletion to Cactus"],"prefix":"10.1007","author":[{"given":"Sheikh Shakil","family":"Akhtar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geevarghese","family":"Philip","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s00224-022-10076-x","volume":"66","author":"Y Aoike","year":"2022","unstructured":"Aoike, Y., Gima, T., Hanaka, T., Kiyomi, M., Kobayashi, Y., Kobayashi, Y., Kurita, K., Otachi, Y.: An improved deterministic parameterized algorithm for cactus vertex deletion. Theory Comput. Syst. 66(2), 502\u2013515 (2022)","journal-title":"Theory Comput. Syst."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-53536-3_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"\u00c9 Bonnet","year":"2016","unstructured":"Bonnet, \u00c9., Brettell, N., Kwon, O., Marx, D.: Parameterized vertex deletion problems for hereditary graph classes with a block property. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 233\u2013244. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53536-3_20"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Brimkov, B., Hicks, I.V.: Memory efficient algorithms for cactus graphs and block graphs. Discret. Appl. Math. 216, 393\u2013407 (2017). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X15005193, graph-theoretic and Polyhedral Combinatorics Issues and Approaches in Imaging Sciences, https:\/\/doi.org\/10.1016\/j.dam.2015.10.032","DOI":"10.1016\/j.dam.2015.10.032"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic. a language-theoretic approach. Encycl. Math. Appl. 138 (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"El-Mallah, E., Colbourn, C.: The complexity of some edge deletion problems. IEEE Tran. Cir. Syst. 35(3), 354\u2013362 (1988). https:\/\/doi.org\/10.1109\/31.1748, funding Information: Manuscript received May 27, 1987; revised October 19, 1987. C. J. Colbourn\u2019s research was supported by NSERC Canada under Grant A0579. This paper was recommended by K. Thulasiraman and N. Deo, Guest Editors for this issue","DOI":"10.1109\/31.1748"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","volume":"55","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discret. Math. 55(2), 151\u2013159 (1985)","journal-title":"Discret. Math."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Combinat. Theory, Series B 38(1), 8\u201322 (1985)","journal-title":"J. Combinat. Theory, Series B"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F Harary","year":"1953","unstructured":"Harary, F., Uhlenbeck, G.E.: On the number of husimi trees. Proc. Natl. Acad. Sci. 39(4), 315\u2013322 (1953)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","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"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.dam.2024.01.028","volume":"348","author":"I Koch","year":"2024","unstructured":"Koch, I., Pardal, N., dos Santos, V.F.: Edge deletion to tree-like graph classes. Discret. Appl. Math. 348, 122\u2013131 (2024)","journal-title":"Discret. Appl. Math."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_19"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discret. Math. 55(2), 221\u2013232 (1985)","journal-title":"Discret. Math."},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106317","volume":"179","author":"D Tsur","year":"2023","unstructured":"Tsur, D.: Faster deterministic algorithm for cactus vertex deletion. Inf. Process. Lett. 179, 106317 (2023)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/BF01939361","volume":"26","author":"P Winter","year":"1986","unstructured":"Winter, P.: An algorithm for the enumeration of spanning trees. BIT Numer. Math. 26(1), 44\u201362 (1986)","journal-title":"BIT Numer. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:48Z","timestamp":1780780488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}