{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:43Z","timestamp":1742911783604,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_4","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"46-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2517-0298","authenticated-orcid":false,"given":"Ruy","family":"Fabila-Monroy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2458-6427","authenticated-orcid":false,"given":"Rosna","family":"Paul","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6557-2355","authenticated-orcid":false,"given":"Daniel","family":"Perz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2172-9285","authenticated-orcid":false,"given":"Patrick","family":"Schnider","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19, 265\u2013281 (2002). https:\/\/doi.org\/10.1023\/A:1021231927255","journal-title":"Order"},{"key":"4_CR2","unstructured":"Aichholzer, O., et al.: Perfect matchings with crossings. In: Abstracts of the Computational Geometry: Young Researchers Forum, pp. 24\u201327 (2021). https:\/\/cse.buffalo.edu\/socg21\/files\/YRF-Booklet.pdf#page=24"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Comb. 23(1), 67\u201384 (2007). https:\/\/doi.org\/10.1007\/s00373-007-0704-5","journal-title":"Graphs Comb."},{"key":"4_CR4","unstructured":"Asinowski, A.: The number of non-crossing perfect plane matchings is minimized (almost) only by point sets in convex position (2015). arXiv preprint arXiv:1502.05332"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.comgeo.2017.05.006","volume":"68","author":"A Asinowski","year":"2018","unstructured":"Asinowski, A., Rote, G.: Point sets with many non-crossing perfect matchings. Comput. Geom. 68, 7\u201333 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.05.006","journal-title":"Comput. Geom."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00454-013-9538-5","volume":"50","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. Discrete Comput. Geom. 50(3), 771\u2013783 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9538-5","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1007\/s00454-020-00251-7","volume":"64","author":"D Eppstein","year":"2020","unstructured":"Eppstein, D.: Counting polygon triangulations is hard. Discrete Comput. Geom. 64(4), 1210\u20131234 (2020). https:\/\/doi.org\/10.1007\/s00454-020-00251-7","journal-title":"Discrete Comput. Geom."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-04166-6_17","volume-title":"Formal Power Series and Algebraic Combinatorics","author":"P Flajolet","year":"2000","unstructured":"Flajolet, P., Noy, M.: Analytic combinatorics of chord diagrams. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds.) Formal Power Series and Algebraic Combinatorics, pp. 191\u2013201. Springer, Heidelberg. (2000). https:\/\/doi.org\/10.1007\/978-3-662-04166-6_17"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of $$K_n$$. Comput. Geom. 16(4), 211\u2013221 (2000). https:\/\/doi.org\/10.1016\/S0925-7721(00)00010-9","journal-title":"Comput. Geom."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1090\/conm\/223\/03141","volume":"223","author":"J Pach","year":"1999","unstructured":"Pach, J., Solymosi, J.: Halving lines and perfect cross-matchings. Adv. Discrete Comput. Geom. 223, 245\u2013249 (1999)","journal-title":"Adv. Discrete Comput. Geom."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.aam.2014.04.001","volume":"57","author":"V Pilaud","year":"2014","unstructured":"Pilaud, V., Rue, J.: Analytic combinatorics of chord and hyperchord diagrams with $$k$$ crossings. Adv. Appl. Math. 57, 60\u2013100 (2014). https:\/\/doi.org\/10.1016\/j.aam.2014.04.001","journal-title":"Adv. Appl. Math."},{"issue":"129","key":"4_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1090\/S0025-5718-1975-0366686-9","volume":"29","author":"J Riordan","year":"1975","unstructured":"Riordan, J.: The distribution of crossings of chords joining pairs of $$2n$$ points on a circle. Math. Comput. 29(129), 215\u2013222 (1975). https:\/\/doi.org\/10.1090\/S0025-5718-1975-0366686-9","journal-title":"Math. Comput."},{"issue":"3","key":"4_CR13","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":"4_CR14","unstructured":"You, C.: Improving Sharir and Welzl\u2019s bound on crossing-free matchings through solving a stronger recurrence (2017). arXiv preprint arXiv:1701.05909"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:05:17Z","timestamp":1653779117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}