@InProceedings{alon_et_al:LIPIcs.MFCS.2024.8, author = {Alon, Noga and Gr{\o}nlund, Allan and J{\o}rgensen, S{\o}ren Fuglede and Larsen, Kasper Green}, title = {{Sublinear Time Shortest Path in Expander Graphs}}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-335-5}, ISSN = {1868-8969}, year = {2024}, volume = {306}, editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.8}, URN = {urn:nbn:de:0030-drops-205646}, doi = {10.4230/LIPIcs.MFCS.2024.8}, annote = {Keywords: Shortest Path, Expanders, Breadth First Search, Graph Algorithms} }