@InProceedings{chekuri_et_al:LIPIcs.ICALP.2016.7,
author = {Chekuri, Chandra and Ene, Alina and Pilipczuk, Marcin},
title = {{Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.7},
URN = {urn:nbn:de:0030-drops-62737},
doi = {10.4230/LIPIcs.ICALP.2016.7},
annote = {Keywords: Disjoint paths, symmetric demands, planar directed graph}
}