{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:33:29Z","timestamp":1766378009482},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_36","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"372-383","source":"Crossref","is-referenced-by-count":6,"title":["Tree Drawings on the Hexagonal Grid"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bachmaier","sequence":"first","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Brunner","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Hofmeier","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Matzeder","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Unfried","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"36_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S.N. Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett.\u00a025(4), 263\u2013267 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"36_CR2","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1002\/spe.4380230802","volume":"23","author":"A. Bloesch","year":"1993","unstructured":"Bloesch, A.: Aestetic layout of generalized trees. Softw. Pract. Exper.\u00a023(8), 817\u2013827 (1993)","journal-title":"Softw. Pract. Exper."},{"issue":"2","key":"36_CR3","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., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl.\u00a023(2), 153\u2013162 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"36_CR4","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. Theory Appl.\u00a02, 187\u2013200 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"36_CR5","unstructured":"Dolev, D., Trickey, H.W.: On linear area embedding of planar graphs. Tech. Rep. STAN-CS-81-876, Stanford University, Stanford, CA, USA (1981)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-31843-9_14","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 122\u2013132. Springer, Heidelberg (2005)"},{"key":"36_CR7","first-page":"10","volume":"5","author":"P. Eades","year":"1992","unstructured":"Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications\u00a05, 10\u201336 (1992)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-77537-9_11","volume-title":"Graph Drawing","author":"F. Frati","year":"2008","unstructured":"Frati, F.: Straight-line orthogonal drawings of binary and ternary trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 76\u201387. Springer, Heidelberg (2008)"},{"issue":"3","key":"36_CR9","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":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00086","volume":"8","author":"A. Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algo. App.\u00a08(2), 135\u2013160 (2004)","journal-title":"J. Graph Algo. App."},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Live Data Structures in Logic Programs","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mulkers, A. (ed.) Live Data Structures in Logic Programs. LNCS, vol.\u00a0675, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"key":"36_CR12","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a01. Addison-Wesley, Reading (1968)"},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawing of trees. IEEE Trans. Software Eng.\u00a07(2), 223\u2013228 (1981)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"36_CR14","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. Theory Appl.\u00a015(4), 175\u2013202 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"36_CR15","doi-asserted-by":"publisher","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. Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"36_CR16","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J.Q.W. Walker","year":"1990","unstructured":"Walker, J.Q.W.: A node-positioning algorithm for general trees. Softw. Pract. Exper.\u00a020(7), 685\u2013705 (1990)","journal-title":"Softw. Pract. Exper."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T00:23:10Z","timestamp":1551745390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}