{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:34:11Z","timestamp":1774334051342,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","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-981-95-7127-7_5","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:52Z","timestamp":1770977212000},"page":"64-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and\u00a0Parameterized Tractability of\u00a0the\u00a0Weak Graph Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3446-4343","authenticated-orcid":false,"given":"Maike","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5609-5739","authenticated-orcid":false,"given":"Wolf","family":"Ki\u00dfler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Kubon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Ahmed, M., Fasy, B.T., Wenk, C.: Local persistent homology based distance between maps. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 43\u201352 (2014). https:\/\/doi.org\/10.1145\/2666310.2666390","DOI":"10.1145\/2666310.2666390"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101743","volume":"95","author":"HA Akitaya","year":"2021","unstructured":"Akitaya, H.A., Buchin, M., Kilgus, B., Sijben, S., Wenk, C.: Distance measures for embedded graphs. Comput. Geom. 95, 101743 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101743","journal-title":"Comput. Geom."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/S0196-6774(03)00085-3","volume":"49","author":"H Alt","year":"2003","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algor. 49(2), 262\u2013283 (2003). https:\/\/doi.org\/10.1016\/S0196-6774(03)00085-3","journal-title":"J. Algor."},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995). https:\/\/doi.org\/10.1142\/S0218195995000064","DOI":"10.1142\/S0218195995000064"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the 11th International Symposium on Computational Geometry, pp. 211\u2013219. ACM (1995). https:\/\/doi.org\/10.1145\/220279.220302","DOI":"10.1145\/220279.220302"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Buchin, M., Chambers, E., Fang, P., Fasy, B.T., Gasparovic, E., Munch, E., Wenk, C.: Distances between immersed graphs: metric properties. La Matematica 1\u201326 (2023). https:\/\/doi.org\/10.1007\/s44007-022-00037-8","DOI":"10.1007\/s44007-022-00037-8"},{"key":"5_CR7","unstructured":"Buchin, M., Ki\u00dfler, W.: Hardness and modifications of the weak graph distance. In: EuroCG 2024 (2024). https:\/\/eurocg2024.math.uoi.gr\/data\/uploads\/paper_49.pdf"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Cheong, O., Gudmundsson, J., Kim, H.S., Schymura, D., Stehn, F.: Measuring the similarity of geometric graphs. In: Proceedings of the 8th International Symposium on Experimental Algorithms, pp. 101\u2013112 (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_11","DOI":"10.1007\/978-3-642-02011-7_11"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00020-D","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Disc. Math. 30(3), 289\u2013293 (1980). https:\/\/doi.org\/10.1016\/0012-365X(80)90236-8","journal-title":"Disc. Math."},{"key":"5_CR11","unstructured":"Kubon, F.: On the Weak Graph Distance and its Three Crossing-Rigid Variants. Master\u2019s thesis, Ruhr University Bochum (2025)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2023.102056","volume":"118","author":"S Majhi","year":"2024","unstructured":"Majhi, S., Wenk, C.: Distance measures for geometric graphs. Comput. Geom. 118, 102056 (2024). https:\/\/doi.org\/10.1016\/j.comgeo.2023.102056","journal-title":"Comput. Geom."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Matousek, J.: Lectures on Discrete Geometry, vol.\u00a0212. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"L Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.: Planar 3-colorability is polynomial complete. ACM SIGACT News 5(3), 19\u201325 (1973). https:\/\/doi.org\/10.1145\/1008293.1008294","journal-title":"ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:12:11Z","timestamp":1774325531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_5","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":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}