{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:16Z","timestamp":1760441416474,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_6","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Routing Between Non-Visible Vertices"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"6_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. 6410, pp. 266\u2013278. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16926-7_25"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-29344-3_8","volume-title":"LATIN 2012: Theoretical Informatics","author":"P Bose","year":"2012","unstructured":"Bose, P., Fagerberg, R., Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 85\u201396. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-29344-3_8"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-48971-0_3","volume-title":"Algorithms and Computation","author":"P Bose","year":"2015","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive local routing with constraints. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 23\u201334. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48971-0_3"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: ISVD, pp. 25\u201331 (2006)","DOI":"10.1109\/ISVD.2006.28"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theor. Comput. Sci. 324(2), 273\u2013288 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Netw."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-54423-1_10","volume-title":"LATIN 2014: Theoretical Informatics","author":"P Bose","year":"2014","unstructured":"Bose, P., Renssen, A.: Upper bounds on the spanning ratio of constrained theta-graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 108\u2013119. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54423-1_10"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: STOC, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"6_CR9","unstructured":"Das, G.: The visibility graph contains a bounded-degree spanner. In: CCCG, pp. 70\u201375 (1997)"},{"key":"6_CR10","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: CCCG, pp. 51\u201354 (1999)"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-218-4","volume-title":"Guide to Wireless Sensor Networks","author":"S Misra","year":"2009","unstructured":"Misra, S., Misra, S.C., Woungang, I.: Guide to Wireless Sensor Networks. Springer, Heidelberg (2009)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-03073-4_43","volume-title":"Mathematical Theory and Computational Practice","author":"H R\u00e4cke","year":"2009","unstructured":"R\u00e4cke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419\u2013429. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03073-4_43"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:18:57Z","timestamp":1750447137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}