![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/isaac/0001MNWW20
@inproceedings{DBLP:conf/isaac/0001MNWW20, author = {Meng He and J. Ian Munro and Yakov Nekrich and Sebastian Wild and Kaiyu Wu}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {25:1--25:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.25}, doi = {10.4230/LIPICS.ISAAC.2020.25}, timestamp = {Thu, 16 Sep 2021 18:08:15 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001MNWW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.