@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2023.35,
author = {Gudmundsson, Joachim and Sha, Yuan},
title = {{Shortest Beer Path Queries in Digraphs with Bounded Treewidth}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.35},
URN = {urn:nbn:de:0030-drops-193379},
doi = {10.4230/LIPIcs.ISAAC.2023.35},
annote = {Keywords: Graph algorithms, Shortest Path, Data structures, Bounded treewidth}
}