A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs

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]

Abstract

Abstract is missing.