{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:45Z","timestamp":1725502065291},"publisher-location":"Berlin, Heidelberg","reference-count":6,"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_12","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"88-100","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial Area Bounds for MST Embeddings of Trees"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaufmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","first-page":"239","volume-title":"Algorithms and Data Structures","author":"G. Battista Di","year":"1995","unstructured":"Di Battista, G., Liotta, G.: Computing proximity drawings of trees in the 3-dimensioanl space. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 239\u2013250. Springer, Heidelberg (1995)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"crossref","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, 1\u201315 (1996)","journal-title":"Algorithmica"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, H., Liu, Q., Jia, X.: Heuristic algorithms for real-time data aggregation in wireless sensor networks. In: Proceedings of the 2006 International Conference on Communications and Mobile Computing (2006)","DOI":"10.1145\/1143549.1143774"},{"key":"12_CR5","unstructured":"King, J.: Realization of Degree 10 Minimum Spanning Trees in 3-Space. In: CCCG 2006. Proceedings of the 18th Canadian Conference on Computational Geometry, pp. 39\u201342 (2006)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"L. Clyde","year":"1992","unstructured":"Clyde, L., Monma, C.L., Suri, S.: Transitions in Geometric Minimum Spanning Trees. Discrete & Computational Geometry\u00a08, 265\u2013293 (1992)","journal-title":"Discrete & Computational Geometry"}],"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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:46Z","timestamp":1619507746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_12","relation":{},"subject":[]}}