{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:12Z","timestamp":1740107112759,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1422311","CCF-1423615"],"award-info":[{"award-number":["CCF-1422311","CCF-1423615"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["614.001.504"],"award-info":[{"award-number":["614.001.504"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W1230"],"award-info":[{"award-number":["W1230"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02558-z","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T13:04:55Z","timestamp":1662383095000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to Fit a Tree in a Box"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6827-2200","authenticated-orcid":false,"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"key":"2558_CR1","doi-asserted-by":"publisher","unstructured":"Bachmaier, C., Matzeder, M.: Drawing unordered trees on $$k$$-grids. In: Rahman, M.S., Nakano, S.I. (eds.) WALCOM: Algorithms and Computation, pp. 198\u2013210 (2012). https:\/\/doi.org\/10.1007\/978-3-642-28076-4_20","DOI":"10.1007\/978-3-642-28076-4_20"},{"key":"2558_CR2","doi-asserted-by":"publisher","unstructured":"Biedl, T., Mondal, D.: On upward drawings of trees on a given grid. In: 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), pp. 318\u2013325 (2017). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_25","DOI":"10.1007\/978-3-319-73915-1_25"},{"issue":"1","key":"2558_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-002-0937-x","volume":"34","author":"TM Chan","year":"2002","unstructured":"Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica 34(1), 1\u201313 (2002)","journal-title":"Algorithmica"},{"key":"2558_CR4","doi-asserted-by":"publisher","unstructured":"Chan, T.M.: Tree drawings revisited. In: 34th International Symposium on Computational Geometry (SoCG 2018), vol.\u00a099, pp. 23:1\u201323:15 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.23","DOI":"10.4230\/LIPIcs.SoCG.2018.23"},{"issue":"4","key":"2558_CR5","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."},{"key":"2558_CR6","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Penna, P.: Minimum-area hv drawings of complete binary trees. In: International Symposium on Graph Drawing, pp. 371\u2013382. Springer (1997)","DOI":"10.1007\/3-540-63938-1_82"},{"issue":"3","key":"2558_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":"2558_CR8","unstructured":"Dunham, W.: Euler: the master of us all. Dolciani Mathematical Expositions (Book 22), Mathematical Association of America (1999)"},{"key":"2558_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sci. 169, 23\u201337 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(97)84223-5","journal-title":"Theor. Comput. Sci."},{"issue":"03","key":"2558_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A Garg","year":"1996","unstructured":"Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 6(03), 333\u2013356 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2558_CR11","doi-asserted-by":"publisher","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In: Computational Science and Its Applications (ICCSA 2003), pp. 876\u2013885 (2003). https:\/\/doi.org\/10.1007\/3-540-44842-X_89","DOI":"10.1007\/3-540-44842-X_89"},{"issue":"2","key":"2558_CR12","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 Algor. Appl. 8(2), 135\u2013160 (2004). https:\/\/doi.org\/10.7155\/jgaa.00086","journal-title":"J. Graph Algor. Appl."},{"key":"2558_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(89)90118-X","volume":"31","author":"A Gregori","year":"1989","unstructured":"Gregori, A.: Unit-length embedding of binary trees on a square grid. Inf. Process. Lett. 31, 167\u2013173 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90118-X","journal-title":"Inf. Process. Lett."},{"key":"2558_CR14","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85\u2013103 (1972). https:\/\/doi.org\/10.2307\/2271828","DOI":"10.2307\/2271828"},{"key":"2558_CR15","doi-asserted-by":"crossref","unstructured":"Krug, M., Wagner, D.: Minimizing the area for planar straight-line grid drawings. In: International Symposium on Graph Drawing, pp. 207\u2013212. Springer (2007)","DOI":"10.1007\/978-3-540-77537-9_21"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02558-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02558-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02558-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:44:56Z","timestamp":1667418296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02558-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,5]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2558"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02558-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,9,5]]},"assertion":[{"value":"17 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"155"}}