{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:56:29Z","timestamp":1767239789067},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_65","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"767-778","source":"Crossref","is-referenced-by-count":4,"title":["Euclidean Greedy Drawings of Trees"],"prefix":"10.1007","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S. Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 260\u2013271. Springer, Heidelberg (2013)"},{"key":"65_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-11805-0_17","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 171\u2013182. Springer, Heidelberg (2010)"},{"issue":"1","key":"65_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl.\u00a014(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"65_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R. Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete Comput. Geom.\u00a043, 375\u2013392 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"65_CR5","first-page":"431","volume-title":"Proc. Symp. Theory of Computing (STOC 1993)","author":"G. Battista Di","year":"1993","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. In: Proc. Symp. Theory of Computing (STOC 1993), pp. 431\u2013437. ACM (1993)"},{"issue":"11","key":"65_CR6","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1109\/TC.2010.257","volume":"60","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy geometric routing using hyperbolic geometry. IEEE Trans. Computers\u00a060(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Computers"},{"key":"65_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Algorithms and Computation","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the euclidean plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 781\u2013791. Springer, Heidelberg (2009)"},{"key":"65_CR8","first-page":"1902","volume-title":"Proc. Computer Communications (INFOCOM 2007)","author":"R. Kleinberg","year":"2007","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Proc. Computer Communications (INFOCOM 2007), pp. 1902\u20131909. IEEE (2007)"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T. Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom.\u00a044, 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"65_CR10","first-page":"5224","volume":"1306","author":"M. N\u00f6llenburg","year":"2013","unstructured":"N\u00f6llenburg, M., Prutkin, R.: Euclidean greedy drawings of trees. CoRR arXiv:1306.5224 (2013)","journal-title":"CoRR arXiv"},{"issue":"1","key":"65_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci.\u00a0344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"65_CR12","first-page":"96","volume-title":"Proc. Mobile Computing and Networking (MobiCom 2003)","author":"A. Rao","year":"2003","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. Mobile Computing and Networking (MobiCom 2003), pp. 96\u2013108. ACM (2003)"},{"key":"65_CR13","first-page":"138","volume-title":"Proc. Discrete Algorithms (SODA 1990)","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. Discrete Algorithms (SODA 1990), pp. 138\u2013148. SIAM, Philadelphia (1990)"},{"key":"65_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-29700-7_2","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"J.J. Wang","year":"2012","unstructured":"Wang, J.J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 13\u201325. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:50:57Z","timestamp":1558011057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}