{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:16:36Z","timestamp":1733548596217,"version":"3.30.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0925-7721(97)00013-8","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"25-42","source":"Crossref","is-referenced-by-count":7,"title":["Linear area upward drawings of AVL trees"],"prefix":"10.1016","volume":"9","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"P.","family":"Penna","sequence":"additional","affiliation":[]},{"given":"A.","family":"Piperno","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00013-8_BIB1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adelson-Velskii","year":"1962","journal-title":"Soviet Math. Dokl."},{"issue":"4","key":"10.1016\/S0925-7721(97)00013-8_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","article-title":"A note on optimal area algorithms for upward drawings of binary trees","volume":"2","author":"Crescenzi","year":"1992","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"5","key":"10.1016\/S0925-7721(97)00013-8_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB4","series-title":"Proceedings International Workshop AVI '92","first-page":"386","article-title":"Minimum size h-v drawings","author":"Eades","year":"1992"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB5","series-title":"Proceedings ACM Symposium on Computational Geometry","first-page":"359","article-title":"Area-efficient upward tree drawing","author":"Garg","year":"1993"},{"year":"1989","series-title":"Concrete Mathematics","author":"Graham","key":"10.1016\/S0925-7721(97)00013-8_BIB6"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1080\/00150517.1982.12430014","article-title":"An entropy view of Fibonacci trees","volume":"20","author":"Horibe","year":"1982","journal-title":"Fibonacci Quarterly"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1080\/00150517.1983.12429957","article-title":"Notes on Fibonacci trees and their optimality","volume":"21","author":"Horibe","year":"1983","journal-title":"Fibonacci Quarterly"},{"year":"1975","series-title":"The Art of Computer Programming: Sorting and Searching","author":"Knuth","key":"10.1016\/S0925-7721(97)00013-8_BIB9"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawing of trees","volume":"7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"article-title":"Linear and planar arrangements of graphs","year":"1976","author":"Shiloach","key":"10.1016\/S0925-7721(97)00013-8_BIB11"},{"key":"10.1016\/S0925-7721(97)00013-8_BIB12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00289576","article-title":"The complexity of drawing trees nicely","volume":"18","author":"Supowit","year":"1983","journal-title":"Acta Informatica"},{"issue":"2","key":"10.1016\/S0925-7721(97)00013-8_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T18:14:37Z","timestamp":1733508877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0925772197000138"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00013-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}