{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:59Z","timestamp":1725664199067},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_215","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:45:37Z","timestamp":1330271137000},"page":"487-495","source":"Crossref","is-referenced-by-count":4,"title":["Parallel h-v drawings of binary trees"],"prefix":"10.1007","author":[{"given":"Panagiotis T.","family":"Metaxas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonis","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"Abrahamson, K., Dadoun, N., Kirkpatrick, D. and Przytycka, T. A Simple Parallel Tree Contraction Algorithm. J. of Algorithms, 10(1989), pp. 287\u2013302.","journal-title":"J. of Algorithms"},{"key":"57_CR2","unstructured":"Chen, C-H and Tollis, I. Parallel Algorithms for Slicing Floorplan Designs. In Proc. of SPDP '90, Dec. 1990, pp. 279\u2013282."},{"key":"57_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G. and Piperno, A. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Computational Geometry: Theory and Applications, Vol. 2, pp. 187\u2013200, 1992.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G. and Tamassia, R. Algorithms for Plane Representation of Acyclic Digraphs. Theoretical Computer Science, Vol. 61, pp. 175\u2013198, 1988.","journal-title":"Theoretical Computer Science"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G. Algorithms for Drawing Graphs: an Annotated Bibliography. Tech. Report, Brown Univ., June 1993.","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"57_CR6","unstructured":"Eades, P., Lin, T., and Lin, X. Two Tree Drawing Conventions. TR 174, Key Centre for Software Technology, Dept. of Computer Science, The University of Queensland, 1990. (To appear in Computational Geometry and Applications)"},{"key":"57_CR7","first-page":"386","volume":"36","author":"P. Eades","year":"1992","unstructured":"Eades, P., Lin, T., and Lin, X. Minimum Size h-v Drawings, Advanced Visual Interfaces (Proceedings of AVI 92), World Series in Computer Science Vol. 36, pp. 386\u2013394, 1992.","journal-title":"World Series in Computer Science"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Garg, A., Goodrich, M.T., and Tamassia, R. Area-Efficient Upward Tree Drawings, 9th Annual Symposium on Computational Geometry, pp. 359\u2013368, 1992.","DOI":"10.1145\/160985.161165"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Metaxas, P., Pantziou, G., Symvonis A. Parallel h-v Drawings of Binary Trees. Technical Report 480, Basser Dept. of Computer Science, Uninversity of Sydney, March 1994.","DOI":"10.1007\/3-540-58325-4_215"},{"key":"57_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"Stockmeyer, L. Optimal Orientations of Cells in Slicing Floorplan Designs. Information and Control 57, pp. 91\u2013101, 1983.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_215.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:32Z","timestamp":1605647972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_215","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}