{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:17Z","timestamp":1742598617092,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_386","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:58Z","timestamp":1330275298000},"page":"307-317","source":"Crossref","is-referenced-by-count":8,"title":["Optimal-area upward drawings of AVL trees"],"prefix":"10.1007","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"A.","family":"Piperno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"36_CR1","first-page":"1259","volume":"3","author":"G.M. Adelson-Velskii","year":"1962","unstructured":"G.M. Adelson-Velskii and E.M. Landis. An algorithm for the organization of information. Soviet Math. Dokl., 3:1259\u20131262, 1962.","journal-title":"Soviet Math. Dokl."},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory and Applications, 2:187\u2013200, 1992.","journal-title":"Computational Geometry: Theory and Applications"},{"unstructured":"G. Di Battista, P. Eades, and R. Tamassia. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, to appear. A preliminary version is available via anonymous ftp from wilma.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in \/pub\/papers\/compgeo.","key":"36_CR3"},{"unstructured":"P. Eades, T. Lin, and X. Lin. Minimum size h-v drawings. In Proc. Int. Workshop AVI '92, pages 386\u2013394, 1992.","key":"36_CR4"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1080\/00150517.1982.12430014","volume":"20","author":"Y. Horibe","year":"1982","unstructured":"Y. Horibe. An Entropy View of Fibonacci Trees. Fibonacci Quarterly, 20:168\u2013178, 1982.","journal-title":"Fibonacci Quarterly"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1080\/00150517.1983.12429957","volume":"21","author":"Y. Horibe","year":"1983","unstructured":"Y. Horibe. Notes on Fibonacci Trees and Their Optimality. Fibonacci Quarterly, 21:118\u2013128, 1983.","journal-title":"Fibonacci Quarterly"},{"unstructured":"D.E. Knuth. The Art of Computer Programming, Addison Wesley, 1975.","key":"36_CR7"},{"doi-asserted-by":"crossref","unstructured":"A. Garg, M.T. Goodrich, and R. Tamassia. Area-efficient upward tree drawing. In Proc. ACM Symp. on Computational Geometry, pages 359\u2013368, 1993.","key":"36_CR8","DOI":"10.1145\/160985.161165"},{"unstructured":"R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics, Addison Wesley, 1989.","key":"36_CR9"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. on Software Engineering, SE-7:223\u2013228, 1981.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K.J. Supowit","year":"1983","unstructured":"K.J. Supowit and E. Reingold. The complexity of drawing trees nicely. Acta Information, 18:377\u2013392, 1983.","journal-title":"Acta Information"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_386.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:41:05Z","timestamp":1742596865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_386","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}