{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T17:01:07Z","timestamp":1717606867960},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0304-3975(97)00287-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"51-67","source":"Crossref","is-referenced-by-count":6,"title":["Strictly-upward drawings of ordered search trees"],"prefix":"10.1016","volume":"203","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"P.","family":"Penna","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00287-9_BIB1","series-title":"Proc. Graph Drawing","first-page":"63","article-title":"Optimizing area and aspect ratio in straight-line orthogonal tree drawings","author":"Chan","year":"1996"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB2","doi-asserted-by":"crossref","unstructured":"C.-S. Shin, S.K. Kim, K.-Y. Chwa, Area-efficient algorithms for upward straight-line drawings, in: Proc. COCOON '96, to appear.","DOI":"10.1007\/3-540-61332-3_143"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB4","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":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/S0304-3975(97)00287-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, P. Penna, A. Piperno, Linear area upward drawings of AVL trees, Comput. Geometry: Theory Appl., to appear.","DOI":"10.1016\/S0925-7721(97)00013-8"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB6","series-title":"Proc. Graph Drawing","first-page":"307","article-title":"Optimal-area upward drawings of AVL trees","author":"Crescenzi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB7","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":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/S0304-3975(97)00287-9_BIB8","series-title":"Proc. Internat. Workshop AVI '92","first-page":"386","article-title":"Minimum size h-v drawings","author":"Eades","year":"1992"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB9","series-title":"Proc. ACM Symp. on Computational Geometry","first-page":"359","article-title":"Area-efficient upward tree drawing","author":"Garg","year":"1993"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB10","series-title":"Proc. Graph Drawing","first-page":"286","article-title":"On the computational complexity of upward and rectilinear planarity testing","author":"Garg","year":"1994"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB11","series-title":"The Art of Computer Programming: Sorting and Searching","author":"Knuth","year":"1975"},{"key":"10.1016\/S0304-3975(97)00287-9_BIB12","article-title":"Linear and planar arrangements of graphs","author":"Shiloach","year":"1976"},{"issue":"2","key":"10.1016\/S0304-3975(97)00287-9_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002879?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002879?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:50:25Z","timestamp":1555390225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0304397597002879"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00287-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}