{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:17:38Z","timestamp":1758824258046,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["MTM2017-82166-P"],"award-info":[{"award-number":["MTM2017-82166-P"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE40-0028","ANR-17-CE23-0010","ANR-17-CE23-0010","ANR-20-CE92-0027","ANR-20-CE92-0027"],"award-info":[{"award-number":["ANR-16-CE40-0028","ANR-17-CE23-0010","ANR-17-CE23-0010","ANR-20-CE92-0027","ANR-20-CE92-0027"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02513-y","type":"journal-article","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T18:02:47Z","timestamp":1659722567000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Block Elimination Distance"],"prefix":"10.1007","volume":"38","author":[{"given":"\u00d6znur Ya\u015far","family":"Diner","sequence":"first","affiliation":[]},{"given":"Archontia C.","family":"Giannopoulou","sequence":"additional","affiliation":[]},{"given":"Giannos","family":"Stamoulis","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,5]]},"reference":[{"key":"2513_CR1","doi-asserted-by":"publisher","unstructured":"Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 641\u2013650 (2008). https:\/\/doi.org\/10.1145\/1347082.1347153","DOI":"10.1145\/1347082.1347153"},{"key":"2513_CR2","doi-asserted-by":"publisher","unstructured":"Akanksha, A., Lawqueen, K., Daniel, L., Fahad, P., Ramanujan, M.S., Saket, Meirav, Z.: Deleting, eliminating and decomposing to hereditary classes are all fpt-equivalent. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1976\u20132004 (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.79","DOI":"10.1137\/1.9781611977073.79"},{"key":"2513_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Kanesh, L., Panolan, F., Ramanujan, M.S., Saket, S.: An FPT algorithm for elimination distance to bounded degree graphs. In: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 187 of LIPIcs, pp. 5:1\u20135:11. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.5","DOI":"10.4230\/LIPIcs.STACS.2021.5"},{"key":"2513_CR4","doi-asserted-by":"publisher","unstructured":"Akanksha, A., Ramanujan, M.S.: On the parameterized complexity of clique elimination distance. In: Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC), vol. 180, pp. 1\u201313 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.1","DOI":"10.4230\/LIPIcs.IPEC.2020.1"},{"issue":"2","key":"2513_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4230\/DagRep.4.2.38","volume":"4","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Heggernes, P., Lokshtanov, D.: Graph modification problems (dagstuhl seminar 14071). Dagstuhl Rep. 4(2), 38\u201359 (2014). https:\/\/doi.org\/10.4230\/DagRep.4.2.38","journal-title":"Dagstuhl Rep."},{"issue":"2","key":"2513_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","volume":"75","author":"J Bulian","year":"2016","unstructured":"Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363\u2013382 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0045-3","journal-title":"Algorithmica"},{"issue":"1","key":"2513_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-016-0235-7","volume":"79","author":"J Bulian","year":"2017","unstructured":"Bulian, J., Dawar, A.: Fixed-parameter tractable distances to sparse graph classes. Algorithmica 79(1), 139\u2013158 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0235-7","journal-title":"Algorithmica"},{"key":"2513_CR8","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: Improved bounds for the flat wall theorem. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 256\u2013275 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.20","DOI":"10.1137\/1.9781611973730.20"},{"key":"2513_CR9","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification (2020). arXiv:2001.06867"},{"issue":"1","key":"2513_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/321556.321562","volume":"17","author":"G Derek","year":"1970","unstructured":"Derek, G., Corneil, C.C.: Gotlieb: an efficient algorithm for graph isomorphism. J. ACM 17(1), 51\u201364 (1970). https:\/\/doi.org\/10.1145\/321556.321562","journal-title":"J. ACM"},{"key":"2513_CR11","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Saurabh, S., Misra, N.: Graph modification problems: a modern perspective. In: Proceedings of the 9th International Workshop on Frontiers in Algorithmics (FAW), volume 9130 of LNCS, pp. 3\u20136. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-19647-3_1","DOI":"10.1007\/978-3-319-19647-3_1"},{"issue":"1\u20132","key":"2513_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/mana.19600220107","volume":"22","author":"AD Gabriel","year":"1960","unstructured":"Gabriel, A.D.: In abstrakten graphen vorhandene vollst\u00e4ndige 4-graphen und ihre unterteilungen. Math. Nachr. 22(1\u20132), 61\u201385 (1960). https:\/\/doi.org\/10.1002\/mana.19600220107","journal-title":"Math. Nachr."},{"key":"2513_CR13","doi-asserted-by":"publisher","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Proceedings of the 1st International Workshop Parameterized and Exact Computation (IWPEC), volume 3162 of Lecture Notes in Computer Science, pp. 162\u2013173. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15","DOI":"10.1007\/978-3-540-28639-4_15"},{"issue":"1","key":"2513_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0020-0190(71)90019-6","volume":"1","author":"JE Hopcroft","year":"1971","unstructured":"Hopcroft, J.E., Tarjan, R.E.: A V2 algorithm for determining isomorphism of planar graphs. Inf. Process. Lett. 1(1), 32\u201334 (1971). https:\/\/doi.org\/10.1016\/0020-0190(71)90019-6","journal-title":"Inf. Process. Lett."},{"key":"2513_CR15","doi-asserted-by":"publisher","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Isomorphism of planar graphs. In: Complexity of Computer Computations, The IBM Research Symposia Series, pp. 131\u2013152 (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_13","DOI":"10.1007\/978-1-4684-2001-2_13"},{"key":"2513_CR16","doi-asserted-by":"crossref","unstructured":"Huynh, T., Joret, G., Micha\u0142, P.M., Seweryn, T., Wollan, P.: Excluding a ladder (2020). arXiv:2002.00496","DOI":"10.1007\/s00493-021-4592-8"},{"key":"2513_CR17","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., de\u00a0Kroon, J.J.H., Wlodarczyk, M.: Vertex deletion parameterized by elimination distance and even less. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1757\u20131769. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451068","DOI":"10.1145\/3406325.3451068"},{"issue":"2","key":"2513_CR18","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K Kawarabayashi","year":"2011","unstructured":"Kawarabayashi, K., Kobayashi, Y., Bruce, R.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424\u2013435 (2011). https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004","journal-title":"J. Comb. Theory Ser. B"},{"key":"2513_CR19","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Wollan, P.: A shorter proof of the graph minor algorithm: the unique linkage theorem. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 687\u2013694 (2010). https:\/\/doi.org\/10.1145\/1806689.1806784","DOI":"10.1145\/1806689.1806784"},{"key":"2513_CR20","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Siebertz, S., Vigny, A.: Elimination distance to bounded degree on planar graphs. In: Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 170 of LIPIcs, pp. 65:1\u201365:12 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.65","DOI":"10.4230\/LIPIcs.MFCS.2020.65"},{"issue":"1","key":"2513_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","journal-title":"J. Comb. Theory Ser. B"},{"key":"2513_CR22","doi-asserted-by":"publisher","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: An FPT-algorithm for recognizing $k$-apices of minor-closed graph classes. In: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP), volume 168 of LIPIcs, pp. 95:1\u201395:20 (2020).\nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.95","DOI":"10.4230\/LIPIcs.ICALP.2020.95"},{"key":"2513_CR23","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: $k$-apices of minor-closed graph classes. I. Bounding the obstructions (2021). arXiv:2103.00882"},{"key":"2513_CR24","doi-asserted-by":"publisher","DOI":"10.1145\/3519028","author":"I Sau","year":"2022","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: $k$-apices of minor-closed graph classes. II. Parameterized algorithms. ACM Trans. Algorithms (2022). https:\/\/doi.org\/10.1145\/3519028","journal-title":"ACM Trans. Algorithms"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02513-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:42:38Z","timestamp":1667418158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02513-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,5]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2513"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02513-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,8,5]]},"assertion":[{"value":"20 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"133"}}