On Routing Disjoint Paths in Bounded Treewidth Graphs

Alina Ene; Matthias Mnich; Marcin Pilipczuk; Andrej Risteski

doi:10.4230/LIPIcs.SWAT.2016.15

On Routing Disjoint Paths in Bounded Treewidth Graphs

Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Original language	English
Title of host publication	15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Subtitle of host publication	Proceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland.
Editors	Rasmus Pagh
Publisher	Schloss Dagstuhl
Pages	15:1–15:15
ISBN (Print)	978-3-95977-011-8
DOIs	https://doi.org/10.4230/LIPIcs.SWAT.2016.15
Publication status	Published - 2016
Externally published	Yes

Publication series

Series	Leibniz International Proceedings in Informatics
Volume	53

Access to Document

10.4230/LIPIcs.SWAT.2016.15

Cite this

Ene, Alina ; Mnich, Matthias ; Pilipczuk, Marcin et al. / On Routing Disjoint Paths in Bounded Treewidth Graphs. 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016): Proceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland.. editor / Rasmus Pagh. Schloss Dagstuhl, 2016. pp. 15:1–15:15 (Leibniz International Proceedings in Informatics, Vol. 53).

@inproceedings{de51bdb02dd94034bb57fb434c9d9392,

title = "On Routing Disjoint Paths in Bounded Treewidth Graphs",

author = "Alina Ene and Matthias Mnich and Marcin Pilipczuk and Andrej Risteski",

year = "2016",

doi = "10.4230/LIPIcs.SWAT.2016.15",

language = "English",

isbn = "978-3-95977-011-8",

series = "Leibniz International Proceedings in Informatics",

publisher = "Schloss Dagstuhl",

pages = "15:1–15:15",

editor = "Rasmus Pagh",

booktitle = "15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)",

}

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.. Schloss Dagstuhl, Leibniz International Proceedings in Informatics, vol. 53, pp. 15:1–15:15. https://doi.org/10.4230/LIPIcs.SWAT.2016.15

On Routing Disjoint Paths in Bounded Treewidth Graphs. / Ene, Alina; Mnich, Matthias; Pilipczuk, Marcin et al.
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016): Proceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland.. ed. / Rasmus Pagh. Schloss Dagstuhl, 2016. p. 15:1–15:15 (Leibniz International Proceedings in Informatics, Vol. 53).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - On Routing Disjoint Paths in Bounded Treewidth Graphs

AU - Ene, Alina

AU - Mnich, Matthias

AU - Pilipczuk, Marcin

AU - Risteski, Andrej

PY - 2016

Y1 - 2016

U2 - 10.4230/LIPIcs.SWAT.2016.15

DO - 10.4230/LIPIcs.SWAT.2016.15

M3 - Conference article in proceeding

SN - 978-3-95977-011-8

T3 - Leibniz International Proceedings in Informatics

SP - 15:1–15:15

BT - 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)

A2 - Pagh, Rasmus

PB - Schloss Dagstuhl

ER -

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