@InProceedings{jain_et_al:LIPIcs.ISAAC.2019.12,
author = {Jain, Rahul and Tewari, Raghunath},
title = {{Reachability in High Treewidth Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.12},
URN = {urn:nbn:de:0030-drops-115087},
doi = {10.4230/LIPIcs.ISAAC.2019.12},
annote = {Keywords: graph reachability, simultaneous time-space upper bound, tree decomposition}
}