{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:27Z","timestamp":1760441007459},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00454-011-9343-y","type":"journal-article","created":{"date-parts":[[2011,4,4]],"date-time":"2011-04-04T09:38:54Z","timestamp":1301909934000},"page":"723-736","source":"Crossref","is-referenced-by-count":13,"title":["Kinetic Spanners in \u211dd"],"prefix":"10.1007","volume":"45","author":[{"given":"Mohammad Ali","family":"Abam","sequence":"first","affiliation":[]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,5]]},"reference":[{"key":"9343_CR1","first-page":"364","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"M.A. Abam","year":"2007","unstructured":"Abam, M.A., de Berg, M., Speckmann, B.: Kinetic kd-trees and longest-side kd-trees. In: Proc. ACM Symposium on Computational Geometry, pp. 364\u2013372 (2007)"},{"key":"9343_CR2","first-page":"306","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"M.A. Abam","year":"2008","unstructured":"Abam, M.A., de Berg, M., Gudmundsson, J.: A simple and efficient kinetic spanner. In: Proc. ACM Symposium on Computational Geometry, pp. 306\u2013310 (2008)"},{"key":"9343_CR3","first-page":"344","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"J. Basch","year":"1997","unstructured":"Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proc. ACM Symposium on Computational Geometry, pp. 344\u2013351 (1997)"},{"key":"9343_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"9343_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.comgeo.2004.01.003","volume":"28","author":"P. Bose","year":"2004","unstructured":"Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Comput. Geom. 28, 11\u201318 (2004)","journal-title":"Comput. Geom."},{"key":"9343_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/10515.10534","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"L.P. Chew","year":"1986","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proc. ACM Symposium on Computational Geometry, pp. 169\u2013177 (1986)"},{"key":"9343_CR7","first-page":"56","volume-title":"Proc. ACM Symposium on Theory of Computing","author":"K.L. Clarkson","year":"1987","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proc. ACM Symposium on Theory of Computing, pp. 56\u201365 (1987)"},{"key":"9343_CR8","first-page":"134","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"M. Berg de","year":"2001","unstructured":"de Berg, M., Comba, J., Guibas, L.J.: A segment-tree based kinetic BSP. In: Proc. ACM Symposium on Computational Geometry, pp. 134\u2013140 (2001)"},{"key":"9343_CR9","doi-asserted-by":"crossref","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"},{"key":"9343_CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier, Amsterdam (2000)"},{"issue":"1\u20132","key":"9343_CR11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.comgeo.2005.10.001","volume":"35","author":"J. Gao","year":"2006","unstructured":"Gao, J., Guibas, L.J., Nguyen, A.: Deformable spanners and applications. Comput. Geom. 35(1\u20132), 2\u201319 (2006)","journal-title":"Comput. Geom."},{"key":"9343_CR12","first-page":"591","volume-title":"Proc. ACM\u2013SIAM Symposium on Discrete Algorithms","author":"L.-A. Gottlieb","year":"2008","unstructured":"Gottlieb, L.-A., Roditty, L.: Improved algorithms for fully dynamic geometric spanners. In: Proc. ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 591\u2013600 (2008)"},{"key":"9343_CR13","first-page":"478","volume-title":"Proc. European Symposium on Algorithms","author":"L.-A. Gottlieb","year":"2008","unstructured":"Gottlieb, L.-A., Roditty, L.: An optimal dynamic spanner for doubling metric spaces. In: Proc. European Symposium on Algorithms, pp. 478\u2013489 (2008)"},{"key":"9343_CR14","volume-title":"Handbook on Approximation Algorithms and Metaheuristics. Chap.\u00a052","author":"J. Gudmundsson","year":"2006","unstructured":"Gudmundsson, J., Knauer, C.: Dilation and detour in geometric networks. In: Gonzalez, T. (ed.) Handbook on Approximation Algorithms and Metaheuristics. Chap.\u00a052. Chapman & Hall\/CRC, Boca Raton (2006)"},{"key":"9343_CR15","first-page":"191","volume-title":"Proc. Workshop on Algorithmic Foundations of Robotics","author":"L.J. Guibas","year":"1998","unstructured":"Guibas, L.J.: Kinetic data structures: A state of the art report. In: Proc. Workshop on Algorithmic Foundations of Robotics, pp. 191\u2013209 (1998)"},{"key":"9343_CR16","first-page":"1117","volume-title":"Handbook of Discrete and Computational Geometry","author":"L.J. Guibas","year":"2004","unstructured":"Guibas, L.J.: Motion. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. pp. 1117\u20131134. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"9343_CR17","series-title":"Lecture Notes Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"Proc. Scandinavian Workshop Algorithm Theory","author":"J.M. Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Proc. Scandinavian Workshop Algorithm Theory. Lecture Notes Computer Science, vol. 318, pp. 208\u2013213. Springer, Berlin (1988)"},{"key":"9343_CR18","series-title":"EATCS Monographs","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs. Springer, Berlin (1984)"},{"key":"9343_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"9343_CR20","first-page":"373","volume-title":"Proc. ACM Symposium on Computational Geometry","author":"L. Roditty","year":"2007","unstructured":"Roditty, L.: Fully dynamic geometric spanners. In: Proc. ACM Symposium on Computational Geometry, pp. 373\u2013380 (2007)"},{"key":"9343_CR21","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"9343_CR22","first-page":"225","volume":"89","author":"J. Soares","year":"1992","unstructured":"Soares, J.: Graph spanners: A survey. Congr. Numer. 89, 225\u2013238 (1992)","journal-title":"Congr. Numer."},{"issue":"3","key":"9343_CR23","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"D.E. Willard","year":"1985","unstructured":"Willard, D.E., Lueker, G.S.: Adding range restriction capability to dynamic data structures. J. ACM 32(3), 597\u2013617 (1985)","journal-title":"J. ACM"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9343-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T13:13:53Z","timestamp":1560086033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9343-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,5]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9343-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,5]]}}}