{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:41:57Z","timestamp":1743140517172,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49272-3_9","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"124-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bichromatic Perfect Matchings with\u00a0Crossings"],"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-0002-6150-1998","authenticated-orcid":false,"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2458-6427","authenticated-orcid":false,"given":"Rosna","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1657-9796","authenticated-orcid":false,"given":"Manfred","family":"Scheucher","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":[[2024,1,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.comgeo.2017.05.003","volume":"68","author":"O Aichholzer","year":"2018","unstructured":"Aichholzer, O., Barba, L., Hackl, T., Pilz, A., Vogtenhuber, B.: Linear transformation distance for bichromatic matchings. Comput. Geom. 68, 77\u201388 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.05.003","journal-title":"Comput. Geom."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-031-06678-8_4","volume-title":"Combinatorial Algorithms","author":"O Aichholzer","year":"2022","unstructured":"Aichholzer, O., et al.: Perfect matchings with crossings. In: Bazgan, C., Fernau, H. (eds.) IWOCA 2022. LNCS, vol. 13270, pp. 46\u201359. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06678-8_4"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Felsner, S., Paul, R., Scheucher, M., Vogtenhuber, B.: Bichromatic perfect matchings with crossings (2023). arXiv:2309.00546v1","DOI":"10.1007\/s00453-023-01147-7"},{"key":"9_CR4","unstructured":"Aichholzer, O., Hurtado, F., Vogtenhuber, B.: Compatible matchings for bichromatic plane straight-line graphs. In: Proceedings of EuroCG\u201912, pp. 257\u2013260 (2012). https:\/\/www.eurocg.org\/2012\/booklet.pdf"},{"issue":"8","key":"9_CR5","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.comgeo.2014.08.009","volume":"48","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Barba, L., Langerman, S., Souvaine, D.L.: Bichromatic compatible matchings. Comput. Geom. 48(8), 622\u2013633 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.08.009","journal-title":"Comput. Geom."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Asinowski, A., Miltzow, T., Rote, G.: Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. 6(1), 185\u2013219 (2015). https:\/\/doi.org\/10.20382\/jocg.v6i1a8","DOI":"10.20382\/jocg.v6i1a8"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Kano, M., Urrutia, J.: Discrete geometry on colored point sets in the plane \u2013 a survey. Graphs Comb. 37(1), 1\u201353 (2021). https:\/\/doi.org\/10.1007\/s00373-020-02210-8","DOI":"10.1007\/s00373-020-02210-8"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"107779","DOI":"10.1016\/j.aim.2021.107779","volume":"386","author":"J Pach","year":"2021","unstructured":"Pach, J., Rubin, N., Tardos, G.: Planar point sets determine many pairwise crossing segments. Adv. Math. 386, 107779 (2021). https:\/\/doi.org\/10.1016\/j.aim.2021.107779","journal-title":"Adv. Math."},{"key":"9_CR9","first-page":"126695","volume":"415","author":"M Savi\u0107","year":"2022","unstructured":"Savi\u0107, M., Stojakovi\u0107, M.: Structural properties of bichromatic non-crossing matchings. Appl. Math. Comput. 415, 126695 (2022)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36(3), 695\u2013720 (2006). https:\/\/doi.org\/10.1137\/050636036","journal-title":"SIAM J. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"T\u00f3th, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. 3rd edn. CRC Press, Boca Raton (2017). https:\/\/doi.org\/10.1201\/9781315119601","DOI":"10.1201\/9781315119601"}],"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-031-49272-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:06:08Z","timestamp":1704963968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2024","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":"Isola delle Femmine, Palermo","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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":"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)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}