{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:10:36Z","timestamp":1742983836230,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_8","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"81-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing Trees into 1-Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5937-7636","authenticated-orcid":false,"given":"Felice","family":"De Luca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-1928","authenticated-orcid":false,"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-2444","authenticated-orcid":false,"given":"William","family":"Lenhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9632-3247","authenticated-orcid":false,"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0226-8","volume":"80","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: Recognizing optimal 1-planar graphs in linear time. Algorithmica 80(1), 1\u201328 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.dam.2011.11.014","volume":"160","author":"J Czap","year":"2012","unstructured":"Czap, J., Hud\u00e1k, D.: 1-planarity of complete multipartite graphs. Discrete Appl. Math. 160(4), 505\u2013512 (2012)","journal-title":"Discrete Appl. Math."},{"key":"8_CR3","unstructured":"De Luca, F., et al.: Packing trees into 1-planar graphs. CoRR abs\/1911.01761 (2019)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019)","journal-title":"ACM Comput. Surv."},{"key":"8_CR5","unstructured":"Frati, F.: Planar packing of diameter-four trees. In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, pp. 95\u201398 (2009)"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ipl.2008.11.002","volume":"109","author":"F Frati","year":"2009","unstructured":"Frati, F., Geyer, M., Kaufmann, M.: Planar packing of trees and spider trees. Inf. Process. Lett. 109(6), 301\u2013307 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/jgt.10042","volume":"40","author":"A Garc\u00eda Olaverri","year":"2002","unstructured":"Garc\u00eda Olaverri, A., Hernando, M.C., Hurtado, F., Noy, M., Tejel, J.: Packing trees into planar graphs. J. Graph Theory 40(3), 172\u2013181 (2002)","journal-title":"J. Graph Theory"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40104-6_31","volume-title":"Algorithms and Data Structures","author":"M Geyer","year":"2013","unstructured":"Geyer, M., Hoffmann, M., Kaufmann, M., Kusters, V., T\u00f3th, C.D.: Planar packing of binary trees. In: Dehne, F., Solis-Oba, R., Sack, J.R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 353\u2013364. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40104-6_31"},{"issue":"2","key":"8_CR9","first-page":"109","volume":"8","author":"M Geyer","year":"2017","unstructured":"Geyer, M., Hoffmann, M., Kaufmann, M., Kusters, V., T\u00f3th, C.D.: The planar tree packing theorem. JoCG 8(2), 109\u2013177 (2017)","journal-title":"JoCG"},{"key":"8_CR10","first-page":"149","volume":"11","author":"S Hedetniemi","year":"1981","unstructured":"Hedetniemi, S., Hedetniemi, S., Slater, P.: A note on packing two trees into $$K_n$$. Ars Combin. 11, 149\u2013153 (1981)","journal-title":"Ars Combin."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"7","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.disc.2007.04.009","volume":"308","author":"VP Korzhik","year":"2008","unstructured":"Korzhik, V.P.: Minimal non-1-planar graphs. Discrete Math. 308(7), 1319\u20131327 (2008)","journal-title":"Discrete Math."},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/eujc.1996.0047","volume":"17","author":"M Mah\u00e9o","year":"1996","unstructured":"Mah\u00e9o, M., Sacl\u00e9, J., Wozniak, M.: Edge-disjoint placement of three trees. Eur. J. Comb. 17(6), 543\u2013563 (1996)","journal-title":"Eur. J. Comb."},{"key":"8_CR14","unstructured":"Oda, Y., Ota, K.: Tight planar packings of two trees. In: 22nd European Workshop on Computational Geometry (2006)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"8_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein sechsfarbenproblem auf der kugel. Abh. Math. Semin. Univ. Hamburg 29(1\u20132), 107\u2013117 (1965)","journal-title":"Abh. Math. Semin. Univ. Hamburg"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N Sauer","year":"1978","unstructured":"Sauer, N., Spencer, J.: Edge disjoint placement of graphs. J. Comb. Theory Ser. B 25(3), 295\u2013302 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/eujc.1993.1018","volume":"14","author":"H Wang","year":"1993","unstructured":"Wang, H., Sauer, N.: Packing three copies of a tree into a complete graph. Eur. J. Comb. 14(2), 137\u2013142 (1993)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF01195330","volume":"9","author":"M Wozniak","year":"1993","unstructured":"Wozniak, M., Wojda, A.P.: Triple placement of graphs. Graphs Comb. 9(1), 85\u201391 (1993)","journal-title":"Graphs Comb."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:04:57Z","timestamp":1582139097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}