ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Almost polynomial hardness of node-disjoint paths in grids
Article URLs:
Alternative Article URLs:
Authors: Julia Chuzhoy
  • Toyota Technological Institute at Chicago
David H. K. Kim
  • University of Chicago
Rachit Nimavat
  • Toyota Technological Institute at Chicago
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1318242, 1616584
DBLP Key: conf/stoc/ChuzhoyKN18
Author Comments:

Discuss this paper and its artifacts below