Polynomial bounds for the grid-minor theorem C Chekuri, J Chuzhoy Journal of the ACM (JACM) 63 (5), 1-65, 2016 | 193 | 2016 |

Approximation algorithms for the job interval selection problem and related scheduling problems J Chuzhoy, R Ostrovsky, Y Rabani Mathematics of Operations Research 31 (4), 730-738, 2006 | 133 | 2006 |

On allocating goods to maximize fairness D Chakrabarty, J Chuzhoy, S Khanna 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 107-116, 2009 | 124 | 2009 |

Non-cooperative multicast and facility location games C Chekuri, J Chuzhoy, L Lewin-Eytan, J Naor, A Orda Proceedings of the 7th ACM conference on Electronic commerce, 72-81, 2006 | 117 | 2006 |

Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009 | 107 | 2009 |

An O (k^ 3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design J Chuzhoy, S Khanna 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 437-441, 2009 | 96 | 2009 |

A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 92 | 2020 |

Covering problems with hard capacities J Chuzhoy, J Naor SIAM Journal on Computing 36 (2), 498-515, 2006 | 91 | 2006 |

Hardness of the undirected edge-disjoint paths problem with congestion M Andrews, J Chuzhoy, S Khanna, L Zhang 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 226-241, 2005 | 84 | 2005 |

Asymmetric *k*-center is log^{*} *n*-hard to approximateJ Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ... Journal of the ACM (JACM) 52 (4), 538-551, 2005 | 82 | 2005 |

Asymmetric *k*-center is log^{*} *n*-hard to approximateJ Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ... Journal of the ACM (JACM) 52 (4), 538-551, 2005 | 82 | 2005 |

On the approximability of some network design problems J Chuzhoy, A Gupta, J Naor, A Sinha ACM Transactions on Algorithms (TALG) 4 (2), 1-17, 2008 | 80 | 2008 |

Approximating k-median with non-uniform capacities J Chuzhoy, Y Rabani SODA 5, 952-958, 2005 | 76 | 2005 |

Polynomial flow-cut gaps and hardness of directed cut problems J Chuzhoy, S Khanna Journal of the ACM (JACM) 56 (2), 1-28, 2009 | 74 | 2009 |

Low-distortion embeddings of general metrics into the line M Bǎdoiu, J Chuzhoy, P Indyk, A Sidiropoulos Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 73 | 2005 |

A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2 J Chuzhoy, S Li 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 233-242, 2012 | 69* | 2012 |

Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. M Andrews, J Chuzhoy, V Guruswami, S Khanna, K Talwar, L Zhang Comb. 30 (5), 485-520, 2010 | 69 | 2010 |

Network design for vertex connectivity T Chakraborty, J Chuzhoy, S Khanna Proceedings of the fortieth annual ACM symposium on Theory of computing, 167-176, 2008 | 68 | 2008 |

New hardness results for congestion minimization and machine scheduling J Chuzhoy, J Naor Journal of the ACM (JACM) 53 (5), 707-721, 2006 | 65 | 2006 |

New hardness results for congestion minimization and machine scheduling J Chuzhoy, J Naor Journal of the ACM (JACM) 53 (5), 707-721, 2006 | 65 | 2006 |