On routing disjoint paths in bounded treewidth graphs

Publikationstyp
Conference Paper
Date Issued
2016-06
Sprache
English
Author(s)
Ene, Alina  
Mnich, Matthias  
Pilipczuk, Marcin  
Risteski, Andrej  
TORE-URI
http://hdl.handle.net/11420/4545
First published in
Leibniz international proceedings in informatics (LIPIcs)  
Number in series
53
Article Number
15
Citation
Leibniz International Proceedings in Informatics (LIPIcs) 53: 15 (2016)
Contribution to Conference
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)  
Publisher DOI
10.4230/LIPIcs.SWAT.2016.15
ArXiv ID
1512.01829
DDC Class
004: Computer Sciences