Hung Le, Christian Wulff-Nilsen. Optimal Approximate Distance Oracle for Planar Graphs. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 363-374, IEEE, 2021. [doi]
@inproceedings{LeW21-1,
title = {Optimal Approximate Distance Oracle for Planar Graphs},
author = {Hung Le and Christian Wulff-Nilsen},
year = {2021},
doi = {10.1109/FOCS52979.2021.00044},
url = {https://doi.org/10.1109/FOCS52979.2021.00044},
researchr = {https://researchr.org/publication/LeW21-1},
cites = {0},
citedby = {0},
pages = {363-374},
booktitle = {62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022},
publisher = {IEEE},
isbn = {978-1-6654-2055-6},
}