{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:06Z","timestamp":1720201326384},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2020\/005964"],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018978","name":"Indian Institute of Technology Ropar","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018978","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology, Ministry of Science and Technology, India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1016\/j.tcs.2022.04.011","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T15:46:27Z","timestamp":1650383187000},"page":"61-80","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Pebble guided optimal treasure hunt in anonymous graphs"],"prefix":"10.1016","volume":"922","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2296-3222","authenticated-orcid":false,"given":"Barun","family":"Gorain","sequence":"first","affiliation":[]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Himadri","family":"Nayak","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4908-7165","authenticated-orcid":false,"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2022.04.011_br0010","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/3280823","article-title":"Deterministic graph exploration with advice","volume":"15","author":"Gorain","year":"2019","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2022.04.011_br0020","series-title":"OPODIS","first-page":"263","article-title":"Tradeoffs between cost and information for rendezvous and treasure hunt","author":"Miller","year":"2014"},{"key":"10.1016\/j.tcs.2022.04.011_br0030","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02798690","article-title":"Yet more on the linear search problem","volume":"8","author":"Beck","year":"1970","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.tcs.2022.04.011_br0040","author":"Bouchard"},{"issue":"11","key":"10.1016\/j.tcs.2022.04.011_br0050","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1007\/s00453-020-00724-4","article-title":"Deterministic treasure hunt in the plane with angular hints","volume":"82","author":"Bouchard","year":"2020","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2022.04.011_br0060","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","article-title":"Online searching with turn cost","volume":"361","author":"Demaine","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.011_br0070","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","article-title":"How many ants does it take to find the food?","volume":"608","author":"Emek","year":"2015","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2022.04.011_br0080","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1996.0092","article-title":"Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem","volume":"131","author":"Kao","year":"1996","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2022.04.011_br0090","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/2601068","article-title":"Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences","volume":"10","author":"Ta-Shma","year":"2014","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2022.04.011_br0100","article-title":"The Theory of Search Games and Rendezvous","volume":"vol. 55","author":"Alpern","year":"2003"},{"issue":"2","key":"10.1016\/j.tcs.2022.04.011_br0110","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","article-title":"Searching in the plane","volume":"106","author":"Baeza-Yates","year":"1993","journal-title":"Inf. Comput."},{"issue":"11","key":"10.1016\/j.tcs.2022.04.011_br0120","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","article-title":"On the two-dimensional cow search problem","volume":"109","author":"Lopuszanski","year":"2009","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2022.04.011_br0130","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2011.12.069","article-title":"Searching for an axis-parallel shoreline","volume":"447","author":"Langetepe","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.011_br0140","series-title":"2012 IEEE","first-page":"6513","article-title":"The cow-path game: a competitive vehicle routing problem","author":"Spieser","year":"2012"},{"key":"10.1016\/j.tcs.2022.04.011_br0150","series-title":"2016 IEEE\/RSJ","first-page":"4430","article-title":"A distributed deterministic spiral search algorithm for swarms","author":"Fricke","year":"2016"},{"key":"10.1016\/j.tcs.2022.04.011_br0160","series-title":"OPODIS","first-page":"9:1","article-title":"Overcoming obstacles with ants","author":"Langner","year":"2015"},{"key":"10.1016\/j.tcs.2022.04.011_br0170","author":"Pelc"},{"key":"10.1016\/j.tcs.2022.04.011_br0180","series-title":"ESA","first-page":"54:1","article-title":"Searching a tree with permanently noisy advice","author":"Boczkowski","year":"2018"},{"key":"10.1016\/j.tcs.2022.04.011_br0190","series-title":"The Game of Cops and Robbers on Graphs","author":"Bonato","year":"2011"},{"issue":"4","key":"10.1016\/j.tcs.2022.04.011_br0200","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","article-title":"Search and pursuit-evasion in mobile robotics - a survey","volume":"31","author":"Chung","year":"2011","journal-title":"Auton. Robots"},{"key":"10.1016\/j.tcs.2022.04.011_br0210","author":"Pelc"},{"issue":"6","key":"10.1016\/j.tcs.2022.04.011_br0220","doi-asserted-by":"crossref","first-page":"40:1","DOI":"10.1145\/3356883","article-title":"Tight bounds for undirected graph exploration with pebbles and multiple agents","volume":"66","author":"Disser","year":"2019","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522002158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522002158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T00:14:44Z","timestamp":1674864884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397522002158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":22,"alternative-id":["S0304397522002158"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2022.04.011","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2022,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pebble guided optimal treasure hunt in anonymous graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2022.04.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
