{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:19:33Z","timestamp":1761621573022,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010446","name":"Institute for Basic Science","doi-asserted-by":"crossref","award":["IBS-R029-C1"],"award-info":[{"award-number":["IBS-R029-C1"]}],"id":[{"id":"10.13039\/501100010446","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE23-0010","ANR-18-CE40-0025-01"],"award-info":[{"award-number":["ANR-17-CE23-0010","ANR-18-CE40-0025-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["648527"],"award-info":[{"award-number":["648527"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1D1A1B07050294"],"award-info":[{"award-number":["NRF-2018R1D1A1B07050294"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00453-021-00820-z","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T20:03:20Z","timestamp":1616529800000},"page":"2096-2141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial Kernel for Distance-Hereditary Vertex Deletion"],"prefix":"10.1007","volume":"83","author":[{"given":"Eun Jung","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1820-1962","authenticated-orcid":false,"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"issue":"1","key":"820_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00453-016-0164-5","volume":"78","author":"I Adler","year":"2017","unstructured":"Adler, I., Kant\u00e9, M.M., Kwon, O.: Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. Algorithmica 78(1), 342\u2013377 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"820_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/3284356","volume":"15","author":"A Agrawal","year":"2019","unstructured":"Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Feedback vertex set inspired kernel for chordal vertex deletion. ACM Trans. Algorithms 15(1), 11\u201328 (2019)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"820_CR3","doi-asserted-by":"publisher","first-page":"5138","DOI":"10.1145\/3389338","volume":"16","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Polylogarithmic approximation algorithms for weighted-$$\\cal{F}$$-deletion problems. ACM Trans. Algorithms 16(4), 5138 (2020)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"820_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H-J Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"820_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/jgt.3190120210","volume":"12","author":"A Bouchet","year":"1988","unstructured":"Bouchet, A.: Transforming trees by successive local complementations. J. Graph Theory 12(2), 195\u2013207 (1988)","journal-title":"J. Graph Theory"},{"issue":"3","key":"820_CR6","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2601066","volume":"10","author":"HY Cheung","year":"2014","unstructured":"Cheung, H.Y., Lau, L.C., Leung, K.M.: Algebraic algorithms for linear matroid parity problems. ACM Trans. Algorithms 10(3), 10:1-10:26 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"820_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"820_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"820_CR9","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"WH Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canad. J. Math. 32(3), 734\u2013765 (1980)","journal-title":"Canad. J. Math."},{"issue":"2","key":"820_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"key":"820_CR11","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory, volume 173 of Graduate Texts in Mathematics, 5th edn. Springer, Berlin (2017)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"820_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jcss.2018.05.005","volume":"97","author":"E Eiben","year":"2018","unstructured":"Eiben, E., Ganian, R., Kwon, O.: A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. 97, 121\u2013146 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"820_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On independent circuits contained in a graph. Canad. J. Math. 17, 347\u2013352 (1965)","journal-title":"Canad. J. Math."},{"issue":"7","key":"820_CR14","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.dam.2010.04.015","volume":"159","author":"EM Eschen","year":"2011","unstructured":"Eschen, E.M., Ho\u00e0ng, C.T., Spinrad, J.P., Sritharan, R.: On graphs without a $$C_4$$ or a diamond. Discrete Appl. Math. 159(7), 581\u2013587 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"820_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(89)90268-9","volume":"73","author":"M Farber","year":"1989","unstructured":"Farber, M.: On diameters and radii of bridged graphs. Discrete Math. 73(3), 249\u2013260 (1989)","journal-title":"Discrete Math."},{"key":"820_CR16","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science\u2014FOCS 2012, pp. 470\u2013479. IEEE Computer Soc., Los Alamitos (2012)","DOI":"10.1109\/FOCS.2012.62"},{"issue":"3","key":"820_CR17","doi-asserted-by":"publisher","first-page":"3535","DOI":"10.1145\/3029051","volume":"13","author":"AC Giannopoulou","year":"2017","unstructured":"Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniform kernelization complexity of hitting forbidden minors. ACM Trans. Algorithms 13(3), 3535 (2017)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"820_CR18","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.dam.2011.05.007","volume":"160","author":"E Gioan","year":"2012","unstructured":"Gioan, E., Paul, C.: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. Discrete Appl. Math. 160(6), 708\u2013733 (2012)","journal-title":"Discrete Appl. Math."},{"key":"820_CR19","unstructured":"Gupta, A.: Improved results for directed multicut. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, January 12\u201314, 2003, Baltimore, Maryland, USA, pp. 454\u2013455 (2003)"},{"issue":"112","key":"820_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. Quart. J. Math. Oxford Ser. (2) 28(112), 417\u2013420 (1977)","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"issue":"3","key":"820_CR21","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1137\/17M112035X","volume":"32","author":"BMP Jansen","year":"2018","unstructured":"Jansen, B.M.P., Pilipczuk, M.: Approximation and kernelization for chordal vertex deletion. SIAM J. Discrete Math. 32(3), 2258\u20132301 (2018)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"820_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s00453-016-0230-z","volume":"79","author":"MM Kant\u00e9","year":"2017","unstructured":"Kant\u00e9, M.M., Kim, E.J., Kwon, O., Paul, C.: An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Algorithmica 79(1), 66\u201395 (2017)","journal-title":"Algorithmica"},{"issue":"2","key":"820_CR23","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1145\/2797140","volume":"12","author":"EJ Kim","year":"2016","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. ACM Trans. Algorithms 12(2), 2141 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"820_CR24","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"FT Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"820_CR25","doi-asserted-by":"publisher","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."},{"issue":"2","key":"820_CR26","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Combin. Theory Ser. B 28(2), 208\u2013236 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"820_CR27","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: A fast, simpler algorithm for the matroid parity problem. In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26\u201328, 2008, Proceedings, pp. 240\u2013258 (2008)","DOI":"10.1007\/978-3-540-68891-4_17"},{"issue":"1","key":"820_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S Oum","year":"2005","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Combin. Theory Ser. B 95(1), 79\u2013100 (2005)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00820-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00820-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00820-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T09:08:57Z","timestamp":1624352937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00820-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,23]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["820"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00820-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,3,23]]},"assertion":[{"value":"7 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}