{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:47Z","timestamp":1750307807246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377729","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"306-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A simple and efficient kinetic spanner"],"prefix":"10.1145","author":[{"given":"Mohammad Ali","family":"Abam","sequence":"first","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[{"name":"National ICT Australia Ltd., Sidney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Proc. 18th ACM-SIAM Symposium on Discrete Algorithms","author":"Abam M. A.","year":"2007","unstructured":"M. A. Abam , M. de Berg , M. Farshi and J. Gudmundsson . Region-fault tolerant geometric spanners . In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms , pp. 1 -- 10 , 2007 . M. A. Abam, M. de Berg, M. Farshi and J. Gudmundsson. Region-fault tolerant geometric spanners. In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 1--10, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195998000187"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10534"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00044-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323264"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777794"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of the 9th Canadian Conference on Compuational Geometry","author":"Das G.","year":"1997","unstructured":"G. Das . The visibility graph contains a bounded degree spanner . In Proc. of the 9th Canadian Conference on Compuational Geometry , 1997 . G. Das. The visibility graph contains a bounded degree spanner. In Proc. of the 9th Canadian Conference on Compuational Geometry, 1997."},{"key":"e_1_3_2_1_8_1","first-page":"425","volume-title":"J.-R","author":"Eppstein D.","year":"2000","unstructured":"D. Eppstein . Spanning trees and spanners . In: J.-R . Sack and J. Urrutia (eds.), Handbook of Computational Geometry, Elsevier Science Publishers , pp. 425 -- 461 , 2000 . D. Eppstein. Spanning trees and spanners. In: J.-R. Sack and J. Urrutia (eds.), Handbook of Computational Geometry, Elsevier Science Publishers, pp. 425--461, 2000."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.001"},{"key":"e_1_3_2_1_10_1","first-page":"591","volume-title":"Proc. 18th ACM-SIAM Symposium on Discrete Algorithms","author":"Gottlieb L.-A.","year":"2008","unstructured":"L.-A. Gottlieb and L. Roditty . Improved algorithms for fully dynamic geometric spanners . Proc. 18th ACM-SIAM Symposium on Discrete Algorithms , pp. 591 -- 600 , 2008 . L.-A. Gottlieb and L. Roditty. Improved algorithms for fully dynamic geometric spanners. Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 591--600, 2008."},{"key":"e_1_3_2_1_11_1","volume-title":"Handbook on approximation algorithms and metaheuristics","author":"Gudmundsson J.","year":"2006","unstructured":"J. Gudmundsson and C. Knauer . Dilation and detour in geometric networks . In: T. Gonzalez (ed.), Handbook on approximation algorithms and metaheuristics . Chapter 52. Chapman &Hall\/CRC, 2006 . J. Gudmundsson and C. Knauer. Dilation and detour in geometric networks. In: T. Gonzalez (ed.), Handbook on approximation algorithms and metaheuristics. Chapter 52. Chapman&Hall\/CRC, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382947"},{"key":"e_1_3_2_1_13_1","first-page":"191","volume-title":"Proc. 3rd Workshop on Algorithmic Foundations of Robotics","author":"Guibas L. J.","year":"1998","unstructured":"L. J. Guibas . Kinetic data structures: A state of the art report . In Proc. 3rd Workshop on Algorithmic Foundations of Robotics , pp. 191 -- 209 , 1998 . L. J. Guibas. Kinetic data structures: A state of the art report. In Proc. 3rd Workshop on Algorithmic Foundations of Robotics, pp. 191--209, 1998."},{"key":"e_1_3_2_1_14_1","first-page":"1117","volume-title":"J. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry","author":"Guibas L. J.","year":"2004","unstructured":"L. J. Guibas . Motion. In: J. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry , pp. 1117 -- 1134 . CRC Press , 2 nd edition, 2004 . L. J. Guibas. Motion. In: J. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry, pp. 1117--1134. CRC Press, 2nd edition, 2004.","edition":"2"},{"volume-title":"Handbook of Convex Geometry","author":"Gruber P. M.","key":"e_1_3_2_1_15_1","unstructured":"P. M. Gruber and J. M. Wills (eds.). Handbook of Convex Geometry , Vol. A. North Holland, 1993 . P. M. Gruber and J. M. Wills (eds.). Handbook of Convex Geometry, Vol. A. North Holland, 1993."},{"key":"e_1_3_2_1_16_1","first-page":"168","volume-title":"Proc. 12th ACM-SIAM Symposium on Discrete Algorithms","author":"Karavelas M. I.","year":"2001","unstructured":"M. I. Karavelas and L. J. Guibas . Static and kinetic geometric spanners with applications . In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms , pp. 168 -- 176 , 2001 . M. I. Karavelas and L. J. Guibas. Static and kinetic geometric spanners with applications. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 168--176, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1208237"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41847"},{"key":"e_1_3_2_1_19_1","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"Sharir M.","year":"1995","unstructured":"M. Sharir and P.K. Agarwal . Davenport-Schinzel sequences and their geometric applications . Cambridge University Press , 1995 . M. Sharir and P.K. Agarwal. Davenport-Schinzel sequences and their geometric applications.Cambridge University Press, 1995."},{"key":"e_1_3_2_1_20_1","first-page":"225","article-title":"A survey","volume":"89","author":"Soares J.","year":"1992","unstructured":"J. Soares . Graph spanners : A survey . Congresus Numerantium 89 : 225 -- 238 , 1992 .\\endthebibliography J. Soares. Graph spanners: A survey. Congresus Numerantium 89:225--238, 1992.\\endthebibliography","journal-title":"Congresus Numerantium"}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":20,"alternative-id":["10.1145\/1377676.1377729","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377729","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}