{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:39:16Z","timestamp":1776764356351,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grants"],"award-info":[{"award-number":["Discovery Grants"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grants"],"award-info":[{"award-number":["Discovery Grants"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00224-026-10263-0","type":"journal-article","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:30:25Z","timestamp":1770975025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities"],"prefix":"10.1007","volume":"70","author":[{"given":"William","family":"Evans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"5","key":"10263_CR1","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1137\/15M1031217","volume":"45","author":"W Evans","year":"2016","unstructured":"Evans, W., Kirkpatrick, D., L\u00f6ffler, M., Staals, F.: Minimizing co-location potential of moving entities. SIAM J. Comput. 45(5), 1870\u20131893 (2016)","journal-title":"SIAM J. Comput."},{"key":"10263_CR2","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D., L\u00f6ffler, M., Staals, F.: Competitive query strategies for minimising the ply of the potential locations of moving points. In: Symposium on Computational Geometry, pp. 155\u2013164 (2013)","DOI":"10.1145\/2462356.2462395"},{"key":"10263_CR3","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D., L\u00f6ffler, M., Staals, F.: Query strategies for minimizing the ply of the potential locations of entities moving with different speeds. In: Abstr. 30th European Workshop on Computational Geometry (EuroCG) (2014)","DOI":"10.1145\/2462356.2462395"},{"key":"10263_CR4","doi-asserted-by":"crossref","unstructured":"Busto, D., Evans, W., Kirkpatrick, D.: Minimizing interference potential among moving entities. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2400\u20132418 (2019)","DOI":"10.1137\/1.9781611975482.147"},{"key":"10263_CR5","unstructured":"Guibas, L.J.: Kinetic data structures: A state of the art report. In: Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics on Robotics: The Algorithmic Perspective. WAFR \u201998, pp. 191\u2013209. A. K. Peters, Ltd., USA (1998)"},{"issue":"1","key":"10263_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J Basch","year":"1999","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31(1), 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"10263_CR7","unstructured":"Guibas, L.J., Roeloffzen, M.: Modeling motion. In: Toth, C.D., O\u2019Rourke, J., Goodman, J.E. (eds.) Handbook of Discrete and Computational Geometry, pp. 1401\u20131420. CRC press, Boca Raton (2017). Chap. 53"},{"key":"10263_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes. In: European Symposium on Algorithms, pp. 383\u2013394. Springer (2012)","DOI":"10.1007\/978-3-642-33090-2_34"},{"issue":"1","key":"10263_CR9","first-page":"222","volume":"3","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model. J. Comput. Geometry 3(1), 222\u2013249 (2012)","journal-title":"J. Comput. Geometry"},{"key":"10263_CR10","doi-asserted-by":"crossref","unstructured":"de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic 2-centers in the black-box model. In: Symposium on Computational Geometry, pp. 145\u2013154 (2013)","DOI":"10.1145\/2462356.2462393"},{"key":"10263_CR11","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: Twenty-third Annual ACM Symposium on Theory of Computing. STOC \u201991, pp. 265\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"key":"10263_CR12","unstructured":"Kahan, S.: Real-time processing of moving data. PhD thesis, University of Washington (1991)"},{"key":"10263_CR13","unstructured":"Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. Eur. Assoc. Theor. Comput. Sci. 2(116) (2015)"},{"key":"10263_CR14","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D.: Minimizing query frequency to bound congestion potential for moving entities at a fixed target time. In: Fundamentals of Computation Theory, pp. 162\u2013175 (2023). Note: Journal version in submission","DOI":"10.1007\/978-3-031-43587-4_12"},{"issue":"3","key":"10263_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2008.12.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., Snoeyink, J.: Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geometry: Theory Appl. 43(3), 234\u2013242 (2010)","journal-title":"Comput. Geometry: Theory Appl."},{"key":"10263_CR16","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track, pp. 693\u2013702 (1989)","DOI":"10.1109\/HICSS.1989.48075"},{"key":"10263_CR17","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D.: Minimizing query frequency to bound congestion potential for moving entities at a fixed target time. Algorithms 17(6) (2024)","DOI":"10.3390\/a17060246"},{"issue":"1","key":"10263_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00453-002-0938-9","volume":"34","author":"PC Fishburn","year":"2002","unstructured":"Fishburn, P.C., Lagarias, J.C.: Pinwheel scheduling: Achievable densities. Algorithmica 34(1), 14\u201338 (2002)","journal-title":"Algorithmica"},{"key":"10263_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(97)00119-4","volume":"82","author":"S Anily","year":"1998","unstructured":"Anily, S., Glass, C.A., Hassin, R.: The scheduling of maintenance service. Discret. Appl. Math. 82, 27\u201342 (1998)","journal-title":"Discret. Appl. Math."},{"key":"10263_CR20","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D.: Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. arXiv:2205.09243 (2023)","DOI":"10.1007\/978-3-031-49815-2_2"},{"key":"10263_CR21","doi-asserted-by":"crossref","unstructured":"Evans, W., Kirkpatrick, D.: A frequency-competitive query strategy for maintaining low collision potential among moving entities. In: Workshop on Approximation and Online Algorithms, pp. 14\u201328 (2023)","DOI":"10.1007\/978-3-031-49815-2_2"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10263-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10263-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10263-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:42:35Z","timestamp":1776760955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10263-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,13]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10263"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10263-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,13]]},"assertion":[{"value":"5 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"9"}}