@InProceedings{chatterjee_et_al:LIPIcs.ESA.2016.28,
author = {Chatterjee, Krishnendu and Rasmus Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas},
title = {{Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.28},
URN = {urn:nbn:de:0030-drops-63797},
doi = {10.4230/LIPIcs.ESA.2016.28},
annote = {Keywords: Graph algorithms, Constant-treewidth graphs, Reachability queries, Distance queries}
}