Almost polynomial hardness of node-disjoint paths in grids

Julia Chuzhoy, David H. K. Kim, Rachit Nimavat. Almost polynomial hardness of node-disjoint paths in grids. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 1220-1233, ACM, 2018. [doi]

Abstract

Abstract is missing.