3 papers
cs.DS2019
Large Minors in Expanders
Julia Chuzhoy, Rachit Nimavat
In this paper we study expander graphs and their minors. Specifically, we attempt to answer the following question: what is the largest function , such that every -ver…
cs.DS2018
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
We study the classical Node-Disjoint Paths (NDP) problem: given an undirected -vertex graph G, together with a set {(s_1,t_1),...,(s_k,t_k)} of pairs of its vertices, called sou…
cs.DS2017
Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
In the classical Node-Disjoint Paths (NDP) problem, we are given an -vertex graph , and a collection of pairs of its vertices, called…