@InProceedings{ene_et_al:LIPIcs.SWAT.2016.15,
author = {Ene, Alina and Mnich, Matthias and Pilipczuk, Marcin and Risteski, Andrej},
title = {{On Routing Disjoint Paths in Bounded Treewidth Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.15},
URN = {urn:nbn:de:0030-drops-60378},
doi = {10.4230/LIPIcs.SWAT.2016.15},
annote = {Keywords: Algorithms and data structures, disjoint paths, treewidth}
}