{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:44Z","timestamp":1725495164575},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_30","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"320-332","source":"Crossref","is-referenced-by-count":10,"title":["Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio"],"prefix":"10.1007","author":[{"given":"Ashim","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"30_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-62495-3_38","volume-title":"Comput. Geom. Theory Appl.","author":"T. Chan","year":"1997","unstructured":"T. Chan, M. Goodrich, S. Rao Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl. to appear. Prel. version in Proc. Graph Drawing\u201996, LNCS, vol. 1190, pp. 63\u201375."},{"key":"30_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. Comput. Geom. Theory Appl., 2:187\u2013200, 1992.","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0925-7721(97)00013-8","volume":"9","author":"P. Crescenzi","year":"1998","unstructured":"P. Crescenzi, P. Penna, and A. Piperno. Linear-area upward drawings of AVL trees. Comput. Geom. Theory Appl., 9:25\u201342, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A. Garg","year":"1996","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl., 6:333\u2013356, 1996.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson. Area-efficient graph layouts (for VLSI). In Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., pages 270\u2013281, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0925-7721(99)00053-X","volume":"15","author":"C.-S. Shin","year":"2000","unstructured":"C.-S. Shin, S.K. Kim, S.-H. Kim, and K.-Y. Chwa. Area-efficient algorithms for straight-line tree drawings. Comput. Geom. Theory Appl., 15:175\u20132002, 2000.","journal-title":"Comput. Geom. Theory Appl."},{"issue":"5","key":"30_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(96)81422-0","volume":"57","author":"L. Trevisan","year":"1996","unstructured":"L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57(5):231\u2013236, 1996.","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"30_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2):135\u2013140, 1981.","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:50Z","timestamp":1556969510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}