{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:25Z","timestamp":1725571285363},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_6","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"61-72","source":"Crossref","is-referenced-by-count":2,"title":["Drawing a Tree as a Minimum Spanning Tree Approximation"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-58950-3_389","volume-title":"Graph Drawing","author":"P. Bose","year":"1995","unstructured":"Bose, P., Di Battista, G., Lenhart, W., Liotta, G.: Proximity constraints and representable trees. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 340\u2013351. Springer, Heidelberg (1995)"},{"issue":"1","key":"6_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":"6_CR3","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 (1999)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02086608","volume":"16","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The realization problem for euclidean minimum spanning trees in NP-hard. Algorithmica\u00a016(1), 60\u201382 (1996)","journal-title":"Algorithmica"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02086608","volume":"16","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica\u00a016, 60\u201382 (1996)","journal-title":"Algorithmica"},{"key":"6_CR6","unstructured":"Frati, F., Kaufmann, M.: Polynomial area bounds for MST embeddings of trees. RT-DIA-122-2008, Dept. of Comput. Sc. Univ. Roma Tre (2008)"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-77537-9_12","volume-title":"Graph Drawing","author":"M. Kaufmann","year":"2008","unstructured":"Kaufmann, M.: Polynomial area bounds for MST embeddings of trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 88\u2013100. Springer, Heidelberg (2008)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"6_CR10","unstructured":"King, J.: Realization of degree 10 minimum spanning trees in 3-space. In: Canadian Conference on Computational Geometry (CCCG 2006) (2006)"},{"key":"6_CR11","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (to appear)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-60220-8_66","volume-title":"Algorithms and Data Structures","author":"G. Liotta","year":"1995","unstructured":"Liotta, G., Di Battista, G.: Computing proximity drawings of trees in the 3-dimemsional space. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 239\u2013250. Springer, Heidelberg (1995)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"Monma, C., Suri, S.: Transitions in geometric minimum spanning trees. Discrete Comput. Geom.\u00a08, 265\u2013293 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR14","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Heidelberg (October 1990)","edition":"3"},{"issue":"2","key":"6_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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T16:40:26Z","timestamp":1553272826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}