{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:46:41Z","timestamp":1743079601857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030682101"},{"type":"electronic","value":"9783030682118"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-68211-8_18","type":"book-chapter","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:20:57Z","timestamp":1613690457000},"page":"221-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Compatible Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2401-8670","authenticated-orcid":false,"given":"Alan","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-1322","authenticated-orcid":false,"given":"Zuzana","family":"Mas\u00e1rov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6557-2355","authenticated-orcid":false,"given":"Daniel","family":"Perz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6059-1821","authenticated-orcid":false,"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0148-7722","authenticated-orcid":false,"given":"Josef","family":"Tkadlec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: A central approach to bound the number of crossings in a generalized configuration. In: LAGOS2007, pp. 273\u2013278. ENDM (2007)","DOI":"10.1016\/j.endm.2008.01.047"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Salazar, G.: The rectilinear crossing number of $${K}_n$$: closing in (or are we?). In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 5\u201318. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_2","DOI":"10.1007\/978-1-4614-0110-0_2"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(02)00428-0","volume":"296","author":"O Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F., Krasser, H.: Towards compatible triangulations. TCS 296(1), 3\u201313 (2003)","journal-title":"TCS"},{"key":"18_CR4","first-page":"77","volume":"68","author":"O Aichholzer","year":"2018","unstructured":"Aichholzer, O., Barba, L., Hackl, T., Pilz, A., Vogtenhuber, B.: Linear transformation distance for bichromatic matchings. CGTA 68, 77\u201388 (2018)","journal-title":"CGTA"},{"issue":"6\u20137","key":"18_CR5","first-page":"617","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer, O., et al.: Compatible geometric matchings. CGTA 42(6\u20137), 617\u2013626 (2009)","journal-title":"CGTA"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Duque, F., Fabila-Monroy, R., Hidalgo-Toscano, C., Garc\u00eda-Quintero, O.E.: An ongoing project to improve the rectilinear and the pseudolinear crossing constants. ArXiv e-Prints (2020)","DOI":"10.7155\/jgaa.00540"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"18_CR8","first-page":"622","volume":"48","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Barba, L., Langerman, S., Souvaine, D.: Bichromatic compatible matchings. CGTA 48(8), 622\u2013633 (2015)","journal-title":"CGTA"},{"key":"18_CR9","first-page":"27","volume":"3","author":"B Aronov","year":"1993","unstructured":"Aronov, B., Seidel, R., Souvaine, D.: On compatible triangulations of simple polygons. CGTA 3, 27\u201335 (1993)","journal-title":"CGTA"},{"key":"18_CR10","unstructured":"Arseneva, E., et al.: Compatible paths on labelled point sets. In: CCCG 2018, pp. 54\u201360 (2020)"},{"key":"18_CR11","unstructured":"Babikov, M., Souvaine, D.L., Wenger, R.: Constructing piecewise linear homeomorphisms of polygons with holes. In: CCCG 1997 (1997)"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/TVCG.2009.38","volume":"15","author":"WV Baxter III","year":"2009","unstructured":"Baxter III, W.V., Barla, P., Anjyo, K.: Compatible embedding for 2D shape animation. IEEE Trans. Vis. Comput. Graph. 15(5), 867\u2013879 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"18_CR13","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning ways for your mathematical plays, vol. 1, 2 edn. A. K. Peters Ltd. (2001)"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.2140\/involve.2019.12.351","volume":"12","author":"\u00c9 Czabarka","year":"2019","unstructured":"Czabarka, \u00c9., Wang, Z.: Erd\u0151-Szekeres theorem for cyclic permutations. Involve J. Math. 12(2), 351\u2013360 (2019)","journal-title":"Involve J. Math."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Urrutia, J.: Maximal length common non-intersecting paths. In: CCCG 1996, pp. 185\u2013189 (1996)","DOI":"10.1515\/9780773591134-034"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-24595-7_30","volume-title":"Graph Drawing","author":"C Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Pitta, C.: Intersection-free morphing of planar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 320\u2013331. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_30"},{"key":"18_CR17","first-page":"117","volume":"101","author":"MS Floater","year":"1999","unstructured":"Floater, M.S., Gotsman, C.: How to morph tilings injectively. JCAM 101, 117\u2013129 (1999)","journal-title":"JCAM"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-540-30551-4_47","volume-title":"Algorithms and Computation","author":"P Hui","year":"2004","unstructured":"Hui, P., Schaefer, M.: Paired pointset traversal. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 534\u2013544. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_47"},{"key":"18_CR19","first-page":"89","volume":"49","author":"M Ishaque","year":"2013","unstructured":"Ishaque, M., Souvaine, D.L., T\u00f3th, C.D.: Disjoint compatible geometric matchings. DCG 49, 89\u2013131 (2013)","journal-title":"DCG"},{"key":"18_CR20","unstructured":"Krasser, H.: Kompatible Triangulierungen ebener Punktmengen. Master\u2019s thesis, Graz University of Technology (1999)"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16(1), 111\u2013117 (1996)","journal-title":"Algorithmica"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Saalfeld, A.: Joint triangulations and triangulation maps. In: SoCG 1987, pp. 195\u2013204 (1987)","DOI":"10.1145\/41958.41979"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. E-JC18(1) (2011)","DOI":"10.37236\/557"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.jcta.2013.01.002","volume":"120","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn\u2019s technique. JCTA 120(4), 777\u2013794 (2013)","journal-title":"JCTA"}],"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-3-030-68211-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T12:45:51Z","timestamp":1697892351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68211-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030682101","9783030682118"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68211-8_18","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":"16 February 2021","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 Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yangon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Myanmar","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":"28 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uit.edu.mm\/walcom-2021\/","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":"60","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":"24","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":"40% - 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":"1,8","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)"}}]}}