@InProceedings{dreier_et_al:LIPIcs.IPEC.2019.10,
author = {Dreier, Jan and Fuchs, Janosch and Hartmann, Tim A. and Kuinke, Philipp and Rossmanith, Peter and Tauer, Bjoern and Wang, Hung-Lung},
title = {{The Complexity of Packing Edge-Disjoint Paths}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {10:1--10:16},
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.10},
URN = {urn:nbn:de:0030-drops-114710},
doi = {10.4230/LIPIcs.IPEC.2019.10},
annote = {Keywords: parameterized complexity, embedding, packing, covering, Hamiltonian path, unary binpacking, path-perfect graphs}
}