{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:34:27Z","timestamp":1762342467161,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"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-15914-5_2","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint Compatibility via\u00a0Graph Classes"],"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"}]},{"given":"Julia","family":"Obmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pat\u00e1k","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-1097-9684","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":[[2022,10,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Asinowski, A., Miltzow, T.: Disjoint compatibility graph of non-crossing matchings of points in convex position. Electron. J. Comb. 22, 1\u201365 (2015). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i1p65","DOI":"10.37236\/4403"},{"issue":"6\u20137","key":"2_CR2","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer, O., et al.: Compatible geometric matchings. Comput. Geom. Theor. Appl. 42(6\u20137), 617\u2013626 (2009)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"2_CR3","unstructured":"Aichholzer, O., Garc\u00eda, A., Hurtado, F., Tejel, J.: Compatible matchings in geometric graphs. In: Proceeding XIV Encuentros de Geometr\u00eda Computacional, pp. 145\u2013148. Alcal\u00e1, Spain (2011)"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s003730200038","volume":"18","author":"C Hernando","year":"2002","unstructured":"Hernando, C., Hurtado, F., Noy, M.: Graphs of non-crossing perfect matchings. Graphs Comb. 18(3), 517\u2013532 (2002). https:\/\/doi.org\/10.1007\/s003730200038","journal-title":"Graphs Comb."},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00373-005-0615-2","volume":"21","author":"ME Houle","year":"2005","unstructured":"Houle, M.E., Hurtado, F., Noy, M., Rivera-Campo, E.: Graphs of triangulations and perfect matchings. Graphs Comb. 21(3), 325\u2013331 (2005). https:\/\/doi.org\/10.1007\/s00373-005-0615-2","journal-title":"Graphs Comb."},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_17","DOI":"10.1007\/978-1-4614-0110-0_17"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00454-012-9466-9","volume":"49","author":"M Ishaque","year":"2013","unstructured":"Ishaque, M., Souvaine, D.L., T\u00f3th, C.D.: Disjoint compatible geometric matchings. Discrete Comput. Geom. 49(1), 89\u2013131 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.dam.2020.10.018","volume":"289","author":"M Milich","year":"2021","unstructured":"Milich, M., M\u00fctze, T., Pergel, M.: On flips in planar matchings. Discret. Appl. Math. 289, 427\u2013445 (2021)","journal-title":"Discret. Appl. Math."},{"key":"2_CR9","unstructured":"Obmann, J.: Disjoint Compatibility of Plane Perfect Matchings via other Graph Classes. Master\u2019s thesis, Graz University of Technology (2020)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-68766-3_38","volume-title":"Graph Drawing and Network Visualization","author":"A Pilz","year":"2020","unstructured":"Pilz, A., Rollin, J., Schlipf, L., Schulz, A.: Augmenting geometric graphs with matchings. In: GD 2020. LNCS, vol. 12590, pp. 490\u2013504. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_38"},{"key":"2_CR11","unstructured":"Razen, A.: A lower bound for the transformation of compatible perfect matchings. In: Proceedings of EuroCG, pp. 115\u2013118 (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:33Z","timestamp":1664536473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_2","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":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","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":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"12","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)"}}]}}