{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:12:03Z","timestamp":1771035123659,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"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":[[2013,6,17]]},"DOI":"10.1145\/2462356.2462395","type":"proceedings-article","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T17:18:46Z","timestamp":1389115126000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Competitive query strategies for minimising the ply of the potential locations of moving points"],"prefix":"10.1145","author":[{"given":"William","family":"Evans","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Staals","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"107","volume-title":"Proc. 9th ACM-SIAM Symp. Discrete Algorithms","author":"Agarwal P. K.","year":"1998"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/AMC.2008.4516035"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/262839.263016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1180-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9430-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_114"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998233"},{"key":"e_1_3_2_1_8_1","volume-title":"Columbia University","author":"Eisenman S. B.","year":"2008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033190.2033221"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195994000100"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/336154.336220"},{"key":"e_1_3_2_1_13_1","first-page":"191","volume-title":"Proc. Workshop Algorithmic Found. Robot.","author":"Guibas L. J.","year":"1998"},{"key":"e_1_3_2_1_14_1","first-page":"277","volume-title":"STACS","author":"Hoffmann M.","year":"2008"},{"key":"e_1_3_2_1_15_1","unstructured":"S. H. Kahan. Real-Time Processing of Moving Data. PhD thesis University of Washington 1991.   S. H. Kahan. Real-Time Processing of Moving Data. PhD thesis University of Washington 1991."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9174-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/256292.256294"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997849"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88244-2_12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282221.1282223"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_57"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1177\/0278364908097581","article-title":"Planning time-minimal safe paths amidst unpredictably moving obstacles","author":"van den Berg J.","year":"2008","journal-title":"International Journal of Robotics Research, 27(11--12):1274--1294"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496889"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4108\/chinacom.2010.106"}],"event":{"name":"SoCG '13: Symposium on Computational Geometry 2013","location":"Rio de Janeiro Brazil","acronym":"SoCG '13","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-ninth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462356.2462395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":24,"alternative-id":["10.1145\/2462356.2462395","10.1145\/2462356"],"URL":"https:\/\/doi.org\/10.1145\/2462356.2462395","relation":{},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}