@InProceedings{berczi_et_al:LIPIcs.ESA.2017.13,
author = {Berczi, Kristof and Kobayashi, Yusuke},
title = {{The Directed Disjoint Shortest Paths Problem}},
booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-049-1},
ISSN = {1868-8969},
year = {2017},
volume = {87},
editor = {Pruhs, Kirk and Sohler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.13},
URN = {urn:nbn:de:0030-drops-78246},
doi = {10.4230/LIPIcs.ESA.2017.13},
annote = {Keywords: Disjoint paths, shortest path, polynomial time algorithm}
}