{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:56Z","timestamp":1770994016655,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031492716","type":"print"},{"value":"9783031492723","type":"electronic"}],"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_22","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"323-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three Edge-Disjoint Plane Spanning Paths in\u00a0a\u00a0Point Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"P.","family":"Kindermann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"J.","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"G.","family":"Liotta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3102-4166","authenticated-orcid":false,"given":"P.","family":"Valtr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"issue":"2\u20133","key":"22_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(99)00042-6","volume":"93","author":"M Abellanas","year":"1999","unstructured":"Abellanas, M., Garcia-Lopez, J., Hern\u00e1ndez-Pe\u00f1alver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discret. Appl. Math. 93(2\u20133), 141\u2013148 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(99)00042-6","journal-title":"Discret. Appl. Math."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.04.006","volume":"124","author":"O Aichholzer","year":"2017","unstructured":"Aichholzer, O., et al.: Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. 124, 35\u201341 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2017.04.006","journal-title":"Inf. Process. Lett."},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory, Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","DOI":"10.1016\/0095-8956(79)90021-2"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","volume":"25","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B., Eldridge, S.E.: Packings of graphs and applications to computational complexity. J. Comb. Theory Ser. B 25(2), 105\u2013124 (1978). https:\/\/doi.org\/10.1016\/0095-8956(78)90030-8","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.comgeo.2005.08.006","volume":"34","author":"P Bose","year":"2006","unstructured":"Bose, P., Hurtado, F., Rivera-Campo, E., Wood, D.R.: Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2), 116\u2013125 (2006). https:\/\/doi.org\/10.1016\/j.comgeo.2005.08.006","journal-title":"Comput. Geom."},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Geyer, M., Hoffmann, M., Kaufmann, M., Kusters, V., T\u00f3th, C.D.: The planar tree packing theorem. J. Comput. Geom. 8(2), 109\u2013177 (2017). https:\/\/doi.org\/10.20382\/jocg.v8i2a6","DOI":"10.20382\/jocg.v8i2a6"},{"key":"22_CR7","unstructured":"Haler, S.P., Wang, H.: Packing four copies of a tree into a complete graph. Australas. J. Comb. 59, 323\u2013332 (2014). http:\/\/ajc.maths.uq.edu.au\/pdf\/59\/ajc_v59_p323.pdf"},{"key":"22_CR8","first-page":"149","volume":"11","author":"SM Hedetniemi","year":"1981","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: A note on packing two trees into $$k_n$$. Ars Combin. 11, 149\u2013153 (1981)","journal-title":"Ars Combin."},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J Hershberger","year":"1992","unstructured":"Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32(2), 249\u2013267 (1992). https:\/\/doi.org\/10.1007\/BF01994880","journal-title":"BIT"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Kindermann, P., Kratochv\u00edl, J., Liotta, G., Valtr, P.: Three edge-disjoint plane spanning paths in a point set. Arxiv report 2306.07237 (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.07237","DOI":"10.48550\/arXiv.2306.07237"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.7155\/jgaa.00574","volume":"25","author":"FD Luca","year":"2021","unstructured":"Luca, F.D., et al.: Packing trees into 1-planar graphs. J. Graph Algorithms Appl. 25(2), 605\u2013624 (2021). https:\/\/doi.org\/10.7155\/jgaa.00574","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR12","unstructured":"Scheucher, M.: Personal communication"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF01787731","volume":"6","author":"SK Teo","year":"1990","unstructured":"Teo, S.K., Yap, H.P.: Packing two graphs of order n having total size at most 2n\u20132. Graphs Comb. 6(2), 197\u2013205 (1990). https:\/\/doi.org\/10.1007\/BF01787731","journal-title":"Graphs Comb."}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:07:20Z","timestamp":1704964040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}