{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:55Z","timestamp":1740109615681,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009133","name":"Karlsruher Institut f\u00fcr Technologie","doi-asserted-by":"publisher","award":["YIG 10-209"],"id":[{"id":"10.13039\/100009133","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ID0EBPAC1857"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00454-017-9913-8","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T10:47:16Z","timestamp":1502102836000},"page":"543-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Euclidean Greedy Drawings of Trees"],"prefix":"10.1007","volume":"58","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"issue":"6","key":"9913_CR1","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MWC.2004.1368893","volume":"11","author":"JN Al-Karaki","year":"2004","unstructured":"Al-Karaki, J.N., Kamal, A.E.: Routing techniques in wireless sensor networks: a survey. IEEE Wireless Commun. 11(6), 6\u201328 (2004)","journal-title":"IEEE Wireless Commun."},{"key":"9913_CR2","doi-asserted-by":"crossref","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching graphs. In: Didimo, W., Patrignani, M. (eds.) Graph Drawing, vol. 7704. Lecture Notes in Computer Science, pp. 260\u2013271. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36763-2_23"},{"issue":"3","key":"9913_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/net.21449","volume":"59","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks 59(3), 267\u2013274 (2012)","journal-title":"Networks"},{"issue":"1","key":"9913_CR4","doi-asserted-by":"crossref","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. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"9913_CR5","unstructured":"Comer, D.E.: Internetworking with TCP\/IP, Vol. 1: Principles, Protocols, and Architecture. 4th edn. Prentice Hall PTR, Upper Saddle River (2000)"},{"key":"9913_CR6","unstructured":"Da Lozzo, G., D\u2019Angelo, A., Frati, F.: On planar greedy drawings of 3-connected planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry (SoCG 2017), vol. 77. Leibniz International Proceedings in Informatics (LIPIcs), pp. 33:1\u201333:16. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl Publishing, Germany (2017)"},{"issue":"2","key":"9913_CR7","doi-asserted-by":"crossref","first-page":"761","DOI":"10.7155\/jgaa.00348","volume":"19","author":"HR Dehkordi","year":"2015","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. 19(2), 761\u2013778 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"9913_CR8","doi-asserted-by":"crossref","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. 43(2), 375\u2013392 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9913_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discret. Math. 9(3), 349\u2013359 (1996)","journal-title":"SIAM J. Discret. Math."},{"issue":"11","key":"9913_CR10","doi-asserted-by":"crossref","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. Comput. 60(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Comput."},{"issue":"1958","key":"9913_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1098\/rsta.2011.0215","volume":"370","author":"J Gao","year":"2012","unstructured":"Gao, J., Guibas, L.J.: Geometric algorithms for sensor networks. Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 370(1958), 27\u201351 (2012)","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."},{"key":"9913_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the Euclidean plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) Algorithms and Computation, vol. 5878. Lecture Notes in Computer Science, pp. 781\u2013791. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-10631-6_79"},{"issue":"3","key":"9913_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Camb. Philos. Soc. 125(3), 441\u2013453 (1999)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"9913_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/0470095121","volume-title":"Protocols and Architectures for Wireless Sensor Networks","author":"H Karl","year":"2005","unstructured":"Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks. Wiley, Hoboken (2005)"},{"key":"9913_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM\u201907), pp. 1902\u20131909. IEEE, Piscataway (2007)","DOI":"10.1109\/INFCOM.2007.221"},{"issue":"3","key":"9913_CR16","doi-asserted-by":"crossref","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. 44(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"9913_CR17","doi-asserted-by":"crossref","unstructured":"Mastakas, K., Symvonis, A.: On the construction of increasing-chord graphs on convex point sets. In: Proceedings of the 6th International Conference on Information, Intelligence, Systems and Applications (IISA\u201915), pp. 1\u20136. IEEE, Piscataway (2015)","DOI":"10.1109\/IISA.2015.7388028"},{"key":"9913_CR18","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., Prutkin, R.: Euclidean greedy drawings of trees. In: Bodlaender, H.L., Italiano, G.F. (eds.) Algorithms-ESA 2013, vol. 8125. Lecture Notes in Computer Science, pp. 767\u2013778. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40450-4_65"},{"issue":"1","key":"9913_CR19","first-page":"47","volume":"7","author":"M N\u00f6llenburg","year":"2016","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"9913_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9913_CR21","doi-asserted-by":"crossref","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom\u201903), pp. 96\u2013108. ACM, New York (2003)","DOI":"10.1145\/938985.938996"},{"key":"9913_CR22","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201990), pp. 138\u2013148. SIAM, Philadelphia (1990)"},{"issue":"10","key":"9913_CR23","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/71.963415","volume":"12","author":"I Stojmenovic","year":"2001","unstructured":"Stojmenovic, I., Lin, X.: Loop-free hybrid single-path\/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst. 12(10), 1023\u20131032 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9913_CR24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.tcs.2013.05.024","volume":"532","author":"J-J Wang","year":"2014","unstructured":"Wang, J.-J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. Theor. Comput. Sci. 532, 80\u201390 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"9913_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9780470443521","volume-title":"Wireless Sensor Networks: A Networking Perspective","author":"J Zheng","year":"2009","unstructured":"Zheng, J., Jamalipour, A.: Wireless Sensor Networks: A Networking Perspective. Wiley-IEEE Press, Hoboken (2009)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9913-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9913-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9913-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T23:06:38Z","timestamp":1569971198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9913-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9913"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9913-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2017,8,7]]}}}