@InProceedings{gao:LIPIcs.IPEC.2019.16,
author = {Gao, Jiawei},
title = {{On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.16},
URN = {urn:nbn:de:0030-drops-114778},
doi = {10.4230/LIPIcs.IPEC.2019.16},
annote = {Keywords: fine-grained complexity, dynamic programming, graph reachability}
}