{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:05Z","timestamp":1725643565030},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_16","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"154-165","source":"Crossref","is-referenced-by-count":1,"title":["Pinning Balloons with Perfect Angles and Optimal Area"],"prefix":"10.1007","author":[{"given":"Immanuel","family":"Halupczok","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-00219-9_36","volume-title":"Graph Drawing","author":"C. Bachmaier","year":"2009","unstructured":"Bachmaier, C., Brandenburg, F.-J., Brunner, W., Hofmeier, A., Matzeder, M., Unfried, T.: Tree Drawings on the Hexagonal Grid. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 372\u2013383. Springer, Heidelberg (2009)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-45078-8_25","volume-title":"Algorithms and Data Structures","author":"G. Barequet","year":"2003","unstructured":"Barequet, G., Goodrich, M.T., Riley, C.: Drawing Graphs with Large Vertices and Thick Edges. In: Dehne, F.K.H.A., Sack, J.-R., Smid, M.H.M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 281\u2013293. Springer, Heidelberg (2003)"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_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., Battista, G.D., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory & Application Geom.\u00a02, 187\u2013200 (1992)","journal-title":"Computational Geometry: Theory & Application Geom."},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1142\/S0129054106004315","volume":"17","author":"C.A. Duncan","year":"2006","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci.\u00a017(5), 1143\u20131164 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-18469-7_17","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 183\u2013194. Springer, Heidelberg (2011), \n                    \n                      http:\/\/arxiv.org\/pdf\/1009.0581v1"},{"key":"16_CR7","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)"},{"key":"16_CR8","first-page":"633","volume-title":"International Conference on Computer Vision and Graphics","author":"S. Grivet","year":"2004","unstructured":"Grivet, S., Auber, D., Domenger, J.P., Melancon, G.: Bubble tree drawing algorithm. In: International Conference on Computer Vision and Graphics, pp. 633\u2013641. Springer, Heidelberg (2004)"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.7155\/jgaa.00153","volume":"11","author":"C.-C. Lin","year":"2007","unstructured":"Lin, C.-C., Yen, H.-C.: On balloon drawings of rooted trees. Journal of Graph Algorithms and Applications\u00a011(2), 431\u2013452 (2007)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4-5","key":"16_CR10","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.tcs.2010.10.015","volume":"412","author":"C.-C. Lin","year":"2011","unstructured":"Lin, C.-C., Yen, H.-C., Poon, S.-H., Fan, J.-H.: Complexity analysis of balloon drawing for rooted trees. Theor. Comput. Sci.\u00a0412(4-5), 430\u2013447 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07(2), 172\u2013183 (1994)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Linking and cutting trees. In: Data Structures and Network Algorithms, ch. 5, pp. 59\u201370. SIAM (1983)","key":"16_CR12","DOI":"10.1137\/1.9781611970265.ch5"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36151-0_25","volume-title":"Graph Drawing","author":"S.T. Teoh","year":"2002","unstructured":"Teoh, S.T., Ma, K.-L.: RINGS: A Technique for Visualizing Large Hierarchies. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 268\u2013275. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:59:26Z","timestamp":1555894766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}