{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:45:59Z","timestamp":1742964359349,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_38","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"490-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Augmenting Geometric Graphs with Matchings"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Pilz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6769-7098","authenticated-orcid":false,"given":"Jonathan","family":"Rollin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-1867","authenticated-orcid":false,"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2134-4852","authenticated-orcid":false,"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"issue":"6\u20137","key":"38_CR1","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.endm.2008.06.040","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer, O., et al.: Compatible geometric matchings. Comput. Geom. 42(6\u20137), 617\u2013626 (2009). https:\/\/doi.org\/10.1016\/j.endm.2008.06.040","journal-title":"Comput. Geom."},{"key":"38_CR2","unstructured":"Aichholzer, O., Garc\u00eda, A., Hurtado, F., Tejel, J.: Compatible matchings in geometric graphs. In: Proceeding of XIV Encuentros de Geometr\u00eda Computacional, pp. 145\u2013148. Alcal\u00e1, Spain (2011)"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Akitaya, H.A., Korman, M., Rudoy, M., Souvaine, D.L., T\u00f3th, C.D.: Circumscribing polygons and polygonizations for disjoint line segments. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), LIPIcs. Leibniz International Proceedings in Informatics, vol. 129, Art. No. 9, 17. Schloss Dagstuhl (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.9","DOI":"10.4230\/LIPIcs.SoCG.2019.9"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.comgeo.2019.01.006","volume":"79","author":"SW Bae","year":"2019","unstructured":"Bae, S.W., de Berg, M., Cheong, O., Gudmundsson, J., Levcopoulos, C.: Shortcuts for the circle. Comput. Geom. 79, 37\u201354 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.01.006","journal-title":"Comput. Geom."},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-14031-0_25","volume-title":"Computing and Combinatorics","author":"M de Berg","year":"2010","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 216\u2013225. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14031-0_25"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.jcss.2017.05.016","volume":"89","author":"N Cohen","year":"2017","unstructured":"Cohen, N., et al.: A polynomial-time algorithm for outerplanar diameter improvement. J. Comput. System Sci. 89, 315\u2013327 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.05.016","journal-title":"J. Comput. System Sci."},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-62127-2_26","volume-title":"Algorithms and Data Structures","author":"J-L De Carufel","year":"2017","unstructured":"De Carufel, J.-L., Grimm, C., Schirra, S., Smid, M.: Minimizing the continuous diameter when augmenting a tree with a shortcut. WADS 2017. LNCS, vol. 10389, pp. 301\u2013312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_26"},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s00453-014-9922-4","volume":"73","author":"T Hartmann","year":"2014","unstructured":"Hartmann, T., Rollin, J., Rutter, I.: Regular augmentation of planar graphs. Algorithmica 73(2), 306\u2013370 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9922-4","journal-title":"Algorithmica"},{"key":"38_CR9","doi-asserted-by":"publisher","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (eds.) Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_17","DOI":"10.1007\/978-1-4614-0110-0_17"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00454-012-9466-9","volume":"49","author":"M Ishaque","year":"2012","unstructured":"Ishaque, M., Souvaine, D.L., T\u00f3th, C.D.: Disjoint compatible geometric matchings. Discrete Comput. Geom. 49(1), 89\u2013131 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9466-9","journal-title":"Discrete Comput. Geom."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0925-7721(93)90003-O","volume":"3","author":"K Jansen","year":"1993","unstructured":"Jansen, K.: One strike against the min-max degree triangulation problem. Comput. Geom. 3, 107\u2013120 (1993). https:\/\/doi.org\/10.1016\/0925-7721(93)90003-O","journal-title":"Comput. Geom."},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11:1\u201311:29 (2008). https:\/\/doi.org\/10.1145\/1346330.1346336","journal-title":"J. ACM"},{"key":"38_CR13","unstructured":"Pilz, A.: Augmentability to cubic graphs. In: Proceedings of 28th European Workshop on Computational Geometry (EuroCG 2012), pp. 29\u201332. Assisi, Italy, March 2012"},{"issue":"6","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1137\/0218075","volume":"18","author":"D Rappaport","year":"1989","unstructured":"Rappaport, D.: Computing simple circuits from a set of line segments is NP-complete. SIAM J. Comput. 18(6), 1128\u20131139 (1989). https:\/\/doi.org\/10.1137\/0218075","journal-title":"SIAM J. Comput."},{"key":"38_CR15","doi-asserted-by":"publisher","unstructured":"Rappaport, D., Imai, H., Toussaint, G.T.: On computing simple circuits on a set of line segments. In: Proceedings of the 2nd Annual Symposium on Computational Geometry (SoCG 1986), pp. 52\u201360. ACM (1986). https:\/\/doi.org\/10.1145\/10515.10521","DOI":"10.1145\/10515.10521"},{"issue":"9","key":"38_CR16","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circ. Syst. 36(9), 1230\u20131234 (1989)","journal-title":"IEEE Trans. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68766-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:38Z","timestamp":1739401418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"29","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":"9","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":"35% - 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,02","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":"3","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 virtually 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)"}}]}}