{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:25:33Z","timestamp":1760441133131},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_10","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"109-120","source":"Crossref","is-referenced-by-count":10,"title":["On the Stretch Factor of the Theta-4 Graph"],"prefix":"10.1007","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 266\u2013278. Springer, Heidelberg (2010)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-33090-2_19","volume-title":"Algorithms \u2013 ESA 2012","author":"N. Bonichon","year":"2012","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: The stretch factor of L\n                1- and L\n                \u2009\u221e\u2009-Delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 205\u2013216. Springer, Heidelberg (2012)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S0218195912600047","volume":"22","author":"P. Bose","year":"2012","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Smid, M., Wuhrer, S.: \u03c0\/2-angle Yao graphs are spanners. International Journal of Computational Geometry & Applications\u00a022(1), 61\u201382 (2012)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"10_CR4","unstructured":"Bose, P., De Carufel, J.-L., Morin, P., van Renssen, A., Verdonschot, S.: Optimal bounds on theta-graphs: More is not always better. In: Proceedings of CCCG, pp. 305\u2013310 (2012)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The \u03b8\n                5-graph is a spanner. To appear in the proceedings of WG 2013 (2013)","DOI":"10.1007\/978-3-642-45043-3_10"},{"key":"10_CR6","series-title":"LNCS","first-page":"182","volume-title":"WADS 2013","author":"P. Bose","year":"2013","unstructured":"Bose, P., van Renssen, A., Verdonschot, S.: On the spanning ratio of theta-graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 182\u2013194. Springer, Heidelberg (2013)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of STOC, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"10_CR8","unstructured":"El Molla, N.M.: Yao spanners for wireless ad hoc networks. Master\u2019s thesis, Villanova University (2009)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT \u201988","author":"J. Keil","year":"1988","unstructured":"Keil, J.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 208\u2013213. Springer, Heidelberg (1988)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546884"},{"key":"10_CR11","unstructured":"Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: Proceedings of CCCG, pp. 207\u2013210 (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:01Z","timestamp":1557930481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}