BibTeX record conf/icalp/BouchardDLP21

download as .bib file

@inproceedings{DBLP:conf/icalp/BouchardDLP21,
  author       = {S{\'{e}}bastien Bouchard and
                  Yoann Dieudonn{\'{e}} and
                  Arnaud Labourel and
                  Andrzej Pelc},
  editor       = {Nikhil Bansal and
                  Emanuela Merelli and
                  James Worrell},
  title        = {Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs},
  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {198},
  pages        = {36:1--36:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.36},
  doi          = {10.4230/LIPICS.ICALP.2021.36},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BouchardDLP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.