Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. In Nikhil Bansal, Emanuela Merelli, James Worrell 0001, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). Volume 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{BouchardDLP21,
title = {Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs},
author = {Sébastien Bouchard and Yoann Dieudonné and Arnaud Labourel and Andrzej Pelc},
year = {2021},
doi = {10.4230/LIPIcs.ICALP.2021.36},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.36},
researchr = {https://researchr.org/publication/BouchardDLP21},
cites = {0},
citedby = {0},
booktitle = {48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
editor = {Nikhil Bansal and Emanuela Merelli and James Worrell 0001},
volume = {198},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-195-5},
}