{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:51:28Z","timestamp":1742971888905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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-22203-0_2","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"16-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compatible Spanning Trees in\u00a0Simple Drawings of\u00a0$$K_n$$"],"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-0003-4239-424X","authenticated-orcid":false,"given":"Kristin","family":"Knorr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-5840","authenticated-orcid":false,"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1037-0203","authenticated-orcid":false,"given":"Nicolas","family":"El Maalouly","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0179-125X","authenticated-orcid":false,"given":"Johannes","family":"Obenaus","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-0001-9185-1246","authenticated-orcid":false,"given":"Meghana","family":"M. Reddy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-6661","authenticated-orcid":false,"given":"Alexandra","family":"Weinberger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., et al.: Compatible geometric matchings. Comput. Geom. Theory Appl. 42(6\u20137), 617\u2013626 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.12.005","DOI":"10.1016\/j.comgeo.2008.12.005"},{"key":"2_CR2","unstructured":"Aichholzer, O., Garc\u00eda, A., Hurtado, F., Tejel, J.: Compatible matchings in geometric graphs. In: Proceedings of the XIV Encuentros de Geometr\u00eda Computacional (EGC2011), pp. 145\u2013148 (2011)"},{"key":"2_CR3","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 (2015)","DOI":"10.37236\/4403"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Krasser, H.: Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97(1), 19\u201322 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2005.09.003. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019005002486","DOI":"10.1016\/j.ipl.2005.09.003"},{"key":"2_CR5","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. Theory Appl. 68, 77\u201388 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.05.003","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR6","unstructured":"Aichholzer, O., et al.: Compatible spanning trees in simple drawings of $$ K_n$$. arXiv preprint (2022). http:\/\/arxiv.org\/abs\/2208.11875"},{"key":"2_CR7","unstructured":"Aichholzer, O., Parada, I., Scheucher, M., Vogtenhuber, B., Weinberger, A.: Shooting stars in simple drawings of $$K_{m, n}$$. In: Proceedings of $$35^{th}$$ European Workshop on Computational Geometry EuroCG 2019, pp. 59:1\u201359:6. Utrecht, The Netherlands (2019). http:\/\/www.eurocg2019.uu.nl\/papers\/59.pdf"},{"issue":"8","key":"2_CR8","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.: Bichromatic compatible matchings. Comput. Geom. Theory Appl. 48(8), 622\u2013633 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.08.009","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geom. 42(1), 60\u201380 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.04.001. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925772108000370","DOI":"10.1016\/j.comgeo.2008.04.001"},{"issue":"8","key":"2_CR10","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.comgeo.2008.03.005","volume":"42","author":"K Buchin","year":"2009","unstructured":"Buchin, K., Razen, A., Uno, T., Wagner, U.: Transforming spanning trees: a lower bound. Comput. Geom. 42(8), 724\u2013730 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.03.005","journal-title":"Comput. Geom."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, A., Pilz, A., Tejel, J.: On plane subgraphs of complete topological drawings. ARS Math. Contemporanea 20, 69\u201387 (2021). https:\/\/doi.org\/10.26493\/1855-3974.2226.e93","DOI":"10.26493\/1855-3974.2226.e93"},{"issue":"1","key":"2_CR12","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."},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","volume":"3","author":"CL Lawson","year":"1972","unstructured":"Lawson, C.L.: Transforming triangulations. Discrete Math. 3(4), 365\u2013372 (1972)","journal-title":"Discrete Math."},{"key":"2_CR14","unstructured":"Rafla, N.H.: The good drawings $$D_n$$ of the complete graph $$K_n$$, Ph. D. thesis, McGill University, Montreal (1988). https:\/\/escholarship.mcgill.ca\/concern\/file_sets\/cv43nx65m?locale=en"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. 1000 (2013). https:\/\/www.combinatorics.org\/DS21","DOI":"10.37236\/2713"},{"key":"2_CR16","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Dtsch. Mathematiker-Ver. 46, 26\u201332 (1936). http:\/\/eudml.org\/doc\/146109"}],"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-22203-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:02:58Z","timestamp":1704351778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_2","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":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","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":"70","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":"25","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":"36% - 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.01","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":"7.03","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)"}}]}}