{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T06:31:40Z","timestamp":1726468300147},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61332-3_143","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:39Z","timestamp":1330292019000},"page":"106-116","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Area-efficient algorithms for upward straight-line tree drawings"],"prefix":"10.1007","author":[{"given":"Chan-Su","family":"Shin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung Kwon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","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, pages 187\u2013200, 1992.","DOI":"10.1016\/0925-7721(92)90021-J"},{"key":"11_CR2","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, Proc. Graph Drawing: DIMACS international workshop, GD'94, volume 894 of LNCS, pages 307\u2013317. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58950-3_386"},{"key":"11_CR3","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. Computational Geometry: Theory and Applications, 4:235\u2013282, 1994.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympo. Comput. Geom., pages 359\u2013368, 1993.","DOI":"10.1145\/160985.161165"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"H. Gazit, G.L. Miller, and S-H. Teng. Optimal tree contraction in an EREW model. In S.K. Tewksbury, B.W. Dickinson, and S.C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture and Technology, pages 139\u2013156. Plenum Press, 1988.","DOI":"10.1007\/978-1-4684-5511-3_9"},{"key":"11_CR6","unstructured":"R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley Publishing Company, 1989."},{"key":"11_CR7","unstructured":"S. K. Kim. Simple algorithms for orthogonal upward drawings of binary and ternary trees. In Proc. 7th Canadian Conference on Computational Geometry, pages 115\u2013120, 1995."},{"key":"11_CR8","unstructured":"C.E. Leiserson. Area efficient VLSI computation. MIT Press, 1983."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"key":"11_CR10","unstructured":"M. H. Overmars. The Design of Dynamic Data Structures. LNCS 894, Springer-Verlag, 1976."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"R.F.Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. In R. Tamassia and I.G. Tollis, editors, Proc. Graph Drawing: DIMACS international workshop, GD'94, volume 894 of LNCS, pages 1\u201311. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58950-3_351"},{"key":"11_CR12","unstructured":"Y. Shiloach. Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science, 1976."},{"key":"11_CR13","unstructured":"J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, 1984."},{"issue":"12","key":"11_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L.G. Valiant","year":"1981","unstructured":"L.G. Valiant. Universality considerations of VLSI circuits. IEEE Trans on Computers, C-30:12:135\u2013140, 1981.","journal-title":"IEEE Trans on Computers"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:22:00Z","timestamp":1578536520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_143"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_143","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}