Rajesh Chitnis. A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. In Tiziana Calamoneri, Federico Corò, editors, Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings. Volume 12701 of Lecture Notes in Computer Science, pages 187-201, Springer, 2021. [doi]
@inproceedings{Chitnis21,
title = {A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs},
author = {Rajesh Chitnis},
year = {2021},
doi = {10.1007/978-3-030-75242-2_13},
url = {https://doi.org/10.1007/978-3-030-75242-2_13},
researchr = {https://researchr.org/publication/Chitnis21},
cites = {0},
citedby = {0},
pages = {187-201},
booktitle = {Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings},
editor = {Tiziana Calamoneri and Federico Corò},
volume = {12701},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-75242-2},
}