{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:23Z","timestamp":1725851963728},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_40","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"536-548","source":"Crossref","is-referenced-by-count":1,"title":["Routing in Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Seiferth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P Callahan","year":"1995","unstructured":"Callahan, P., Kosaraju, S.: A decomposition of multidimensional point sets with applications to \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -nearest-neighbors and \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -body potential fields. J. ACM 42(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Compact routing schemes with improved stretch. In: Proceedings of 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 33\u201341 (2013)","DOI":"10.1145\/2484239.2484268"},{"issue":"1\u20133","key":"40_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"Pierre Fraigniaud","year":"2001","unstructured":"Fraigniaud, Pierre, Gavoille, Cyril: Routing in trees. In: Orejas, F., Spirakis, Paul G., van Leeuwen, Jan (eds.) ICALP 2001. LNCS, vol. 2076, p. 757. Springer, Heidelberg (2001)"},{"issue":"1","key":"40_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/S0097539703436357","volume":"35","author":"J Gao","year":"2005","unstructured":"Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM J. Comput. 35(1), 151\u2013169 (2005)","journal-title":"SIAM J. Comput."},{"key":"40_CR7","series-title":"Network Theory and Applications","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-1-4613-0223-0_4","volume-title":"Ad Hoc Wireless Networking","author":"S Giordano","year":"2004","unstructured":"Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: a taxonomy. In: Cheng, X., Huang, X., Du, D.-Z. (eds.) Ad Hoc Wireless Networking. Network Theory and Applications, vol. 14, pp. 103\u2013136. Springer, New York (2004)"},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1137\/S0097539702409927","volume":"34","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM J. Comput. 34(2), 453\u2013474 (2004)","journal-title":"SIAM J. Comput."},{"key":"40_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"issue":"3","key":"40_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Roditty, L., Tov, R.: New routing techniques and their applications. In: Proceedings of 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 23\u201332 (2015)","DOI":"10.1145\/2767386.2767409"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Comput. J. 28(1), 5\u20138 (1985)","journal-title":"Comput. J."},{"issue":"6","key":"40_CR13","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993\u20131024 (2004)","journal-title":"J. ACM"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"issue":"7","key":"40_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.comgeo.2012.01.015","volume":"45","author":"C Yan","year":"2012","unstructured":"Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for unit disk graphs. Comput. Geom. 45(7), 305\u2013325 (2012)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:19:28Z","timestamp":1559405968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}