{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:14:24Z","timestamp":1752984864866,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"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-83508-8_14","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"186-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Euclidean Maximum Matchings in the Plane\u2014Local to Global"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.3233\/FI-1995-2245","volume":"22","author":"N Alon","year":"1995","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. Fundam. Inform. 22(4), 385\u2013394 (1995). Also in SoCG 1993","journal-title":"Fundam. Inform."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted $$k$$-set packing. Math. Oper. Res. 23(3), 640\u2013648 (1998). Also in ESA 1997","journal-title":"Math. Oper. Res."},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475\u2013493 (1983)","journal-title":"Networks"},{"key":"14_CR4","unstructured":"Bereg, S., Chac\u00f3n-Rivera, O., Flores-Pe\u00f1aloza, D., Huemer, C., P\u00e9rez-Lantero, P., Seara, C.: On maximum-sum matchings of points (2019). arXiv:1911.10610"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1007\/s00453-018-0482-x","volume":"81","author":"A Biniaz","year":"2019","unstructured":"Biniaz, A., et al.: Maximum plane trees in multipartite geometric graphs. Algorithmica 81(4), 1512\u20131534 (2019). Also in WADS 2017","journal-title":"Algorithmica"},{"key":"14_CR6","unstructured":"Carmi, P., Katz, M.J., Morin, P.: Stabbing pairwise intersecting disks by four points (2018). arXiv:1812.06907"},{"issue":"1\u20132","key":"14_CR7","first-page":"111","volume":"21","author":"L Danzer","year":"1986","unstructured":"Danzer, L.: Zur L\u00f6sung des Gallaischen Problems \u00fcber Kreisscheiben in der Euklidischen Ebene. Stud. Sci. Math. Hung. 21(1\u20132), 111\u2013134 (1986)","journal-title":"Stud. Sci. Math. Hung."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1:1\u20131:23 (2014)","DOI":"10.1145\/2529989"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-010-9277-9","volume":"44","author":"A Dumitrescu","year":"2010","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Long non-crossing configurations in the plane. Discrete Comput. Geom. 44(4), 727\u2013752 (2010). Also in STACS 2010","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"14_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0167-6377(84)90059-2","volume":"3","author":"M Dyer","year":"1984","unstructured":"Dyer, M., Frieze, A., McDiarmid, C.: Partitioning heuristics for two geometric maximization problems. Oper. Res. Lett. 3(5), 267\u2013270 (1984)","journal-title":"Oper. Res. Lett."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand. B"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"14_CR14","unstructured":"Eppstein, D.: Geometry junkyard. https:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/maxmatch.html"},{"key":"14_CR15","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms $$($$SODA$$)$$, pp. 434\u2013443 (1990)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Data structures for weighted matching and extensions to b-matching and f-factors. ACM Trans. Algorithms 14(3), 39:1\u201339:80 (2018)","DOI":"10.1145\/3183369"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/65950.65954","volume":"36","author":"HN Gabow","year":"1989","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H.: Efficient implementation of graph algorithms using contraction. J. ACM 36(3), 540\u2013572 (1989)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0215009","volume":"15","author":"Z Galil","year":"1986","unstructured":"Galil, Z., Micali, S., Gabow, H.N.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15(1), 120\u2013130 (1986). Also in FOCS 1982","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"key":"14_CR20","unstructured":"Har-Peled, S., et al.: Stabbing pairwise intersecting disks by five points. In: 29th International Symposium on Algorithms and Computation, ISAAC, pp. 50:1\u201350:12 (2018)"},{"key":"14_CR21","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresber. Dtsch. Math. Ver. 32, 175\u2013176 (1923)","journal-title":"Jahresber. Dtsch. Math. Ver."},{"issue":"7","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1016\/j.disc.2019.03.003","volume":"342","author":"C Huemer","year":"2019","unstructured":"Huemer, C., P\u00e9rez-Lantero, P., Seara, C., Silveira, R.I.: Matching points with disks with a common intersection. Discrete Math. 342(7), 1885\u20131893 (2019)","journal-title":"Discrete Math."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"3","author":"HW Kuhn","year":"1956","unstructured":"Kuhn, H.W.: Variants of the Hungarian method for assignment problems. Naval Res. Logist. Q. 3, 253\u2013258 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"14_CR25","volume-title":"Combinatorial Optimization: Networks And Matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Networks And Matroids. Holt, Rinehart and Winston, New York (1976)"},{"issue":"4","key":"14_CR26","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"McKeown, N., Anantharam, V., Walrand, J.C.: Achieving 100% throughput in an input-queued switch. In: Proceedings of the 15th IEEE INFOCOM, pp. 296\u2013302 (1996)","DOI":"10.1109\/INFCOM.1996.497906"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Comb. Theory Ser. B 31(1), 75\u201381 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01464231","volume":"83","author":"J Radon","year":"1921","unstructured":"Radon, J.: Mengen konvexer K\u00f6rper, die einen gemeinsamen Punkt enthalten. Math. Ann. 83(1), 113\u2013115 (1921)","journal-title":"Math. Ann."},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0377-0427(88)90001-5","volume":"23","author":"F Rendl","year":"1988","unstructured":"Rendl, F.: On the Euclidean assignment problem. J. Comput. Appl. Math. 23(3), 257\u2013265 (1988)","journal-title":"J. Comput. Appl. Math."},{"issue":"1\u20133","key":"14_CR31","first-page":"19","volume":"32","author":"L Stach\u00f3","year":"1981","unstructured":"Stach\u00f3, L.: A solution of Gallai\u2019s problem on pinning down circles. Mat. Lapok 32(1\u20133), 19\u201347 (1981). (1981\/1984)","journal-title":"Mat. Lapok"},{"issue":"1","key":"14_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"15","author":"D Wagner","year":"1995","unstructured":"Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1), 135\u2013150 (1995). Also in ESA 1993","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:09:15Z","timestamp":1725541755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_14","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":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}