{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:57Z","timestamp":1725664797816},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:39:00Z","timestamp":1330295940000},"page":"63-75","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing area and aspect ratio in straight-line orthogonal tree drawings"],"prefix":"10.1007","author":[{"given":"Timothy","family":"Chan","sequence":"first","affiliation":[]},{"given":"S. Rao","family":"Kosaraju","sequence":"additional","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/0020-0190(80)90034-4","volume":"11","author":"R. P. Brent","year":"1980","unstructured":"R. P. Brent and H. T. Kung. On the area of binary tree layouts. Inform. Process. Lett., 11:521\u2013534, 1980.","journal-title":"Inform. Process. Lett."},{"key":"6_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":"6_CR3","doi-asserted-by":"crossref","unstructured":"P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 307\u2013317. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_386"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 359\u2013368, 1993.","DOI":"10.1145\/160985.161165"},{"key":"6_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":"6_CR7","series-title":"ACM Doctoral Dissertation Award Series","volume-title":"Area-efficient graph layouts (for VLSI)","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson. Area-efficient graph layouts (for VLSI). ACM Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1983."},{"issue":"2","key":"6_CR8","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. Softw. Eng., SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"6_CR9","unstructured":"Y. Shiloach. Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science, 1976."},{"issue":"5","key":"6_CR10","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. Information Processing Letters, 57(5):231\u2013236, 1996.","journal-title":"Information Processing Letters"},{"issue":"2","key":"6_CR11","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-62495-3_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:48Z","timestamp":1605647568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}