{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:33:19Z","timestamp":1758267199675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_26","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"361-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How to Fit a Tree in a Box"],"prefix":"10.1007","author":[{"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Parada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., L\u00f6ffler, M., Parada, I.: How to fit a tree in a box. CoRR (2018). http:\/\/arxiv.org\/abs\/1808.10572v1","DOI":"10.1007\/978-3-030-04414-5_26"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-28076-4_20","volume-title":"WALCOM: Algorithms and Computation","author":"C Bachmaier","year":"2012","unstructured":"Bachmaier, C., Matzeder, M.: Drawing unordered trees on k-grids. In: Rahman, M.S., Nakano, S. (eds.) WALCOM 2012. LNCS, vol. 7157, pp. 198\u2013210. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28076-4_20"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.7155\/jgaa.00432","volume":"21","author":"T Biedl","year":"2017","unstructured":"Biedl, T.: Ideal drawings of rooted trees with approximately optimal width. J. Graph Algorithms Appl. 21(4), 631\u2013648 (2017). https:\/\/doi.org\/10.7155\/jgaa.00432","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-319-73915-1_25","volume-title":"Graph Drawing and Network Visualization","author":"T Biedl","year":"2018","unstructured":"Biedl, T., Mondal, D.: On upward drawings of trees on a given grid. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 318\u2013325. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_25"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Chan, T.M.: Tree drawings revisited. In: Speckmann, B., T\u00f3th, C.D. (eds.) 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 99, pp. 23:1\u201323:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.23","DOI":"10.4230\/LIPIcs.SoCG.2018.23"},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P Crescenzi","year":"1992","unstructured":"Crescenzi, P., Battista, G.D., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. 2(4), 187\u2013200 (1992). https:\/\/doi.org\/10.1016\/0925-7721(92)90021-J","journal-title":"Comput. Geom."},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002). https:\/\/doi.org\/10.1145\/568522.568523","journal-title":"ACM Comput. Surv."},{"key":"26_CR8","series-title":"Dolciani Mathematical Expositions (Book 22)","doi-asserted-by":"crossref","DOI":"10.1090\/dol\/022","volume-title":"Euler : The Master of Us All","author":"W Dunham","year":"1999","unstructured":"Dunham, W.: Euler : The Master of Us All. Dolciani Mathematical Expositions (Book 22). Mathematical Association of America, Washington (1999)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1007\/3-540-44842-X_89","volume-title":"Computational Science and Its Applications \u2014 ICCSA 2003","author":"A Garg","year":"2003","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L\u2019Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2669, pp. 876\u2013885. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44842-X_89"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00086","volume":"8","author":"A Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algorithms Appl. 8(2), 135\u2013160 (2004). https:\/\/doi.org\/10.7155\/jgaa.00086","journal-title":"J. Graph Algorithms Appl."},{"issue":"04","key":"26_CR11","doi-asserted-by":"publisher","first-page":"618","DOI":"10.2307\/2271828","volume":"40","author":"Ronald V. Book","year":"1975","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, pp. 85\u2013103 (1972). https:\/\/doi.org\/10.2307\/2271828","journal-title":"The Journal of Symbolic Logic"}],"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-030-04414-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:20:20Z","timestamp":1710249620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"48% - 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.25","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":"3.92","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":"The book also contains 1 full invited paper and 1 contest report","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}