Joachim Gudmundsson, Yuan Sha. Shortest Beer Path Queries in Digraphs with Bounded Treewidth. In Satoru Iwata 0001, Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. Volume 283 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{GudmundssonS23-1,
title = {Shortest Beer Path Queries in Digraphs with Bounded Treewidth},
author = {Joachim Gudmundsson and Yuan Sha},
year = {2023},
doi = {10.4230/LIPIcs.ISAAC.2023.35},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.35},
researchr = {https://researchr.org/publication/GudmundssonS23-1},
cites = {0},
citedby = {0},
booktitle = {34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan},
editor = {Satoru Iwata 0001 and Naonori Kakimura},
volume = {283},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-289-1},
}