{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:54Z","timestamp":1725664914857},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625599"},{"type":"electronic","value":"9783540680727"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62559-3_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:40:34Z","timestamp":1330296034000},"page":"114-125","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Upward drawings of search trees"],"prefix":"10.1007","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"P.","family":"Penna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"11_CR1","unstructured":"C.-S. Shin, S. K. Kim, and K.-Y. Chwa. Area-efficient algorithms for upward straight-line drawings. Proc. COCOON '96, to appear."},{"key":"11_CR2","unstructured":"T.H. Cormen, C.E. Leierson, and R.L. Rivest. Introduction to Algorithms, Mc Graw Hill, 1990."},{"key":"11_CR3","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"},{"key":"11_CR4","unstructured":"P. Crescenzi, P. Penna, and A. Piperno. Linear area upward drawings of AVL trees. Computational Geometry: Theory and Applications, to appear."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. Proc. Graph Drawing, 307\u2013317, 1994.","DOI":"10.1007\/3-540-58950-3_386"},{"key":"11_CR6","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. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235\u2013282, 1994.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR7","unstructured":"P. Eades, T. Lin, and X. Lin. Minimum size h-v drawings. In Proc. Int. Workshop AVI '92, 386\u2013394, 1992."},{"key":"11_CR8","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, 359\u2013368, 1993.","DOI":"10.1145\/160985.161165"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Proc. Graph Drawing, 286\u2013297, 1994.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"11_CR10","unstructured":"D.E. Knuth. The Art of Computer Programming: Sorting and Searching, Addison Wesley, 1975."},{"key":"11_CR11","volume-title":"Ph.D. Thesis","author":"Y. Shiloach","year":"1976","unstructured":"Y. Shiloach. Linear and planar arrangements of graphs. Ph.D. Thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 1976."},{"issue":"2","key":"11_CR12","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. on Computers, C-30(2):135\u2013140, 1981.","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62559-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:53:42Z","timestamp":1578527622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62559-3_11"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625599","9783540680727"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-62559-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}