Follow
Julia Chuzhoy
Title
Cited by
Cited by
Year
Polynomial bounds for the grid-minor theorem
C Chekuri, J Chuzhoy
Journal of the ACM (JACM) 63 (5), 1-65, 2016
1812016
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
1312006
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
1182009
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
1182006
Maximum independent set of rectangles
P Chalermsook, J Chuzhoy
Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009
1042009
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
962009
Covering problems with hard capacities
J Chuzhoy, J Naor
SIAM Journal on Computing 36 (2), 498-515, 2006
862006
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
832005
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
792008
Asymmetric k-center is log* n-hard to approximate
J Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ...
Journal of the ACM (JACM) 52 (4), 538-551, 2005
782005
Asymmetric k-center is log* n-hard to approximate
J Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ...
Journal of the ACM (JACM) 52 (4), 538-551, 2005
782005
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
752005
Polynomial flow-cut gaps and hardness of directed cut problems
J Chuzhoy, S Khanna
Journal of the ACM (JACM) 56 (2), 1-28, 2009
742009
Approximating k-median with non-uniform capacities
J Chuzhoy, Y Rabani
SODA 5, 952-958, 2005
742005
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
712020
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
M Andrews, J Chuzhoy, V Guruswami, S Khanna, K Talwar, L Zhang
Combinatorica 30 (5), 485-520, 2010
692010
New hardness results for congestion minimization and machine scheduling
J Chuzhoy, J Naor
Journal of the ACM (JACM) 53 (5), 707-721, 2006
682006
New hardness results for congestion minimization and machine scheduling
J Chuzhoy, J Naor
Journal of the ACM (JACM) 53 (5), 707-721, 2006
682006
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
67*2012
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
672008
The system can't perform the operation now. Try again later.
Articles 1–20