{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:06:49Z","timestamp":1743066409665,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_3","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"28-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Block Elimination Distance"],"prefix":"10.1007","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":[[2021,9,20]]},"reference":[{"key":"3_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":"3_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Kanesh, L., Panolan, F., Ramanujan, M.S., Saurabh, 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":"3_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, 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:1\u20131:13 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.1","DOI":"10.4230\/LIPIcs.IPEC.2020.1"},{"issue":"2","key":"3_CR4","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":"3_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","volume":"75","author":"J Bulian","year":"2015","unstructured":"Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363\u2013382 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0045-3","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-016-0235-7","volume":"79","author":"J Bulian","year":"2016","unstructured":"Bulian, J., Dawar, A.: Fixed-parameter tractable distances to sparse graph classes. Algorithmica 79(1), 139\u2013158 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0235-7","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/321556.321562","volume":"17","author":"DG Corneil","year":"1970","unstructured":"Corneil, D.G., Gotlieb, C.C.: 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":"3_CR8","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. arXiv:2001.06867 (2020)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Diner, \u00d6.Y., Giannopoulou, A.C., Stamoulis, G., Thilikos, D.M.: Block elimination distance. arXiv:2103.01872 (2021)","DOI":"10.1007\/978-3-030-86838-3_3"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19647-3_1","volume-title":"Frontiers in Algorithmics","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Saurabh, S., Misra, N.: Graph modification problems: a modern perspective. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 3\u20136. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19647-3_1"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"issue":"1","key":"3_CR12","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 V$${^2}$$ 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":"3_CR13","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":"3_CR14","doi-asserted-by":"crossref","unstructured":"Huynh, T., Joret, G., Micek, P., Seweryn, M.T., Wollan, P.: Excluding a ladder. arXiv:2002.00496 (2020)","DOI":"10.1007\/s00493-021-4592-8"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., de Kroon, 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":"3_CR16","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., Reed, B.: The disjoint paths problem in quadratic time. J. Combinat. Theory Ser. B 102(2), 424\u2013435 (2011). https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004","journal-title":"J. Combinat. Theory Ser. B"},{"key":"3_CR17","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"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The Disjoint Paths Problem. J. Combinat. Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","DOI":"10.1006\/jctb.1995.1006"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XX. Wagner\u2019s conjecture. J. Combinat. Theory Ser. B 92(2), 325\u2013357 (2004). https:\/\/doi.org\/10.1016\/j.jctb.2004.08.001","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"3_CR20","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). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.95","DOI":"10.4230\/LIPIcs.ICALP.2020.95"},{"key":"3_CR21","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: $$k$$-apices of minor-closed graph classes. I. Bounding the obstructions. arXiv:2103.00882 (2021)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: $$k$$-apices of minor-closed graph classes. II. Parameterized algorithms. arXiv:2004.12692 (2021)","DOI":"10.1145\/3519028"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:01:44Z","timestamp":1702065704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}