{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:26:39Z","timestamp":1767093999068,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,6]]},"DOI":"10.1145\/3772290.3772317","type":"proceedings-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:18Z","timestamp":1767093858000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Search for Capturing a Moving Target by Two Robots in the F2F Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1074-4838","authenticated-orcid":false,"given":"Khaled","family":"Jawhar","sequence":"first","affiliation":[{"name":"Carleton university, Ottawa, Ontario, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8959-4428","authenticated-orcid":false,"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[{"name":"Carleton university, Ottawa, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/42317"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/b100809"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Spyros Angelopoulos Diogo Ars\u00e9nio and Christoph D\u00fcrr. 2017. Infinite linear programming and online searching with turn cost. Theoretical Computer Science 670 (2017) 11\u201322.","DOI":"10.1016\/j.tcs.2017.01.013"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Ricardo\u00a0A. Baeza-Yates Joseph\u00a0C. Culberson and Gregory J.\u00a0E. Rawlins. 1993. Searching in the Plane. Inf. Comput. 106 2 (1993) 234\u2013252. 10.1006\/inco.1993.1054","DOI":"10.1006\/inco.1993.1054"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"E. Bampas J. Czyzowicz L. Gasieniec D. Ilcinkas R. Klasing T. Kociumaka and D. Pajak. 2019. Linear search by a pair of distinct-speed robots. Algorithmica 81 1 (2019) 317\u2013342.","DOI":"10.1007\/s00453-018-0447-0"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Anatole Beck. 1964. On the linear search problem. Israel Journal of Mathematics 2 4 (1964) 221\u2013228.","DOI":"10.1007\/BF02759737"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"R. Bellman. 1963. An optimal search. SIAM Rev. 5 3 (1963) 274\u2013274.","DOI":"10.1137\/1005070"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57586-5_10"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46078-8_14"},{"key":"e_1_3_3_1_12_2","volume-title":"21st International Conference on Principles of Distributed Systems (OPODIS 2017)","author":"Chuangpishit Huda","year":"2018","unstructured":"Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, and Jaroslav Opatrny. 2018. Evacuating an equilateral triangle in the face-to-face model. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Jared Coleman Dmitry Ivanov Evangelos Kranakis Danny Krizanc and Oscar Morales-Ponce. 2024. Linear Search for an Escaping Target with Unknown Speed. Proceedings of IWOCA (2024).","DOI":"10.2139\/ssrn.4949863"},{"key":"e_1_3_3_1_14_2","unstructured":"Jared Coleman Evangelos Kranakis Danny Krizanc and Oscar Morales-Ponce. 2022. Line Search for an Oblivious Moving Target. Proceedings of OPODIS (2022)."},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Jurek Czyzowicz Stefan Dobrev Konstantinos Georgiou Evangelos Kranakis and Fraser MacQuarrie. 2018. Evacuating two robots from multiple unknown exits in a circle. Theoretical Computer Science 709 (2018) 20\u201330.","DOI":"10.1016\/j.tcs.2016.11.019"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7_14"},{"key":"e_1_3_3_1_17_2","first-page":"27:1\u201327:12","volume-title":"ISAAC","author":"Czyzowicz J.","year":"2016","unstructured":"J. Czyzowicz, K. Georgiou, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. Shende. 2016. Search on a Line by Byzantine Robots. In ISAAC. 27:1\u201327:12."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Jurek Czyzowicz Evangelos Kranakis Danny Krizanc Lata Narayanan and Jaroslav Opatrny. 2019. Search on a line with faulty robots. Distributed Computing 32 6 (2019) 493\u2013504.","DOI":"10.1007\/s00446-017-0296-0"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Erik\u00a0D Demaine S\u00e1ndor\u00a0P Fekete and Shmuel Gal. 2006. Online searching with turn cost. Theoretical computer science 361 2-3 (2006) 342\u2013355.","DOI":"10.1016\/j.tcs.2006.05.018"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Khaled Jawhar and Evangelos Kranakis. 2021. Robot Evacuation on a Line Assisted by a Bike. Information 12 1 (2021) 28.","DOI":"10.3390\/info12010028"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Khaled Jawhar and Evangelos Kranakis. 2025. Capturing a Moving Target by Two Robots in the F2F Model. 10.48550\/arXiv.2503.15688 arxiv:https:\/\/arXiv.org\/abs\/2503.15688\u00a0[cs.RO]","DOI":"10.48550\/arXiv.2503.15688"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"B.\u00a0J. McCabe. 1974. Searching for a one-dimensional random walker. J. Applied Probability (1974) 86\u201393.","DOI":"10.2307\/3212585"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400842063"}],"event":{"name":"ICDCN 2026: 27th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2026","location":"Nara Japan"},"container-title":["Proceedings of the 27th International Conference on Distributed Computing and Networking"],"original-title":[],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:28Z","timestamp":1767093868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772290.3772317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":22,"alternative-id":["10.1145\/3772290.3772317","10.1145\/3772290"],"URL":"https:\/\/doi.org\/10.1145\/3772290.3772317","relation":{},"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"2026-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}