On Routing Disjoint Paths in Bounded Treewidth Graphs

Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Original languageEnglish
Title of host publication15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Subtitle of host publicationProceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland.
EditorsRasmus Pagh
PublisherSchloss Dagstuhl
Pages15:1–15:15
ISBN (Print)978-3-95977-011-8
DOIs
Publication statusPublished - 2016
Externally publishedYes

Publication series

SeriesLeibniz International Proceedings in Informatics
Volume53

Cite this

Ene, A., Mnich, M., Pilipczuk, M., & Risteski, A. (2016). On Routing Disjoint Paths in Bounded Treewidth Graphs. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016): Proceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland. (pp. 15:1–15:15). Schloss Dagstuhl. Leibniz International Proceedings in Informatics, Vol.. 53 https://doi.org/10.4230/LIPIcs.SWAT.2016.15