{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:05:19Z","timestamp":1742389519639},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_11","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"76-87","source":"Crossref","is-referenced-by-count":9,"title":["Straight-Line Orthogonal Drawings of Binary and Ternary Trees"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M., Goodrich, M.T., Rao Kosaraju, S., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom.\u00a023(2), 153\u2013162 (2002)","journal-title":"Comput. Geom."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-002-0937-x","volume":"34","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica\u00a034(1), 1\u201313 (2002)","journal-title":"Algorithmica"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom.\u00a02, 187\u2013200 (1992)","journal-title":"Comput. Geom."},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River, NJ (1999)"},{"key":"11_CR5","unstructured":"Dolev, D., Trickey, H.W.: On linear area embedding of planar graphs. Technical report, Stanford, USA (1981)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A. Garg","year":"1996","unstructured":"Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geometry Appl.\u00a06(3), 333\u2013356 (1996)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"6","key":"11_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/S021819590300130X","volume":"13","author":"A. Garg","year":"2003","unstructured":"Garg, A., Rusu, A.: Area-efficient order-preserving planar straight-line drawings of ordered trees. Int. J. Comput. Geometry Appl.\u00a013(6), 487\u2013505 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In: ICCSA, vol. (3), pp. 876\u2013885 (2003)","DOI":"10.1007\/3-540-44842-X_89"},{"key":"11_CR9","unstructured":"Kim, S.K.: Simple algorithms for orthogonal upward drawings of binary and ternary trees sung. In: CCCG, pp. 115\u2013120 (1995)"},{"key":"11_CR10","unstructured":"Shiloach, Y.: Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute for Science (1976)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-7721(99)00053-X","volume":"15","author":"C.S. Shin","year":"2000","unstructured":"Shin, C.S., Kim, S.K., Chwa, K.Y.: Area-efficient algorithms for straight-line tree drawings. Comput. Geom.\u00a015(4), 175\u2013202 (2000)","journal-title":"Comput. Geom."},{"issue":"2","key":"11_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comp.\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comp."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:46Z","timestamp":1619522146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_11","relation":{},"subject":[]}}