Julia Chuzhoy Vis

*	2009
35	EE	Julia Chuzhoy, Paolo Codenotti: Resource Minimization Job Scheduling. APPROX-RANDOM 2009: 70-83
34	EE	Parinya Chalermsook, Julia Chuzhoy: Maximum independent set of rectangles. SODA 2009: 892-901
33	EE	Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness CoRR abs/0901.0205: (2009)
32	EE	Julia Chuzhoy, Sanjeev Khanna: Polynomial flow-cut gaps and hardness of directed cut problems. J. ACM 56(2): (2009)
	2008
31	EE	Julia Chuzhoy, Sanjeev Khanna: Algorithms for Single-Source Vertex Connectivity. FOCS 2008: 105-114
30	EE	Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna: Network design for vertex connectivity. STOC 2008: 167-176
29	EE	Julia Chuzhoy: Generalized Steiner Network. Encyclopedia of Algorithms 2008
28	EE	Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2): (2008)
27	EE	Julia Chuzhoy, Sanjeev Khanna: An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design CoRR abs/0812.4442: (2008)
	2007
26	EE	Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar: Hardness of routing with congestion in directed graphs. STOC 2007: 165-178
25	EE	Julia Chuzhoy, Sanjeev Khanna: Polynomial flow-cut gaps and hardness of directed cut problems. STOC 2007: 179-188
24	EE	Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor: Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms 3(1): (2007)
23	EE	Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(113): (2007)
22	EE	Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Non-Cooperative Multicast and Facility Location Games. IEEE Journal on Selected Areas in Communications 25(6): 1193-1206 (2007)
21	EE	Julia Chuzhoy, Joseph Naor: The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007)
	2006
20	EE	Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Non-cooperative multicast and facility location games. ACM Conference on Electronic Commerce 2006: 72-81
19	EE	Julia Chuzhoy, Sanjeev Khanna: Hardness of cut problems in directed graphs. STOC 2006: 527-536
18	EE	Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Embedding ultrametrics into low-dimensional spaces. Symposium on Computational Geometry 2006: 187-196
17	EE	Julia Chuzhoy, Sanjeev Khanna: Hardness of Directed Routing with Congestion. Electronic Colloquium on Computational Complexity (ECCC) 13(109): (2006)
16	EE	Julia Chuzhoy, Joseph Naor: New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006)
15	EE	Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006)
14	EE	Julia Chuzhoy, Joseph Naor: Covering Problems with Hard Capacities. SIAM J. Comput. 36(2): 498-515 (2006)
	2005
13	EE	Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang: Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. FOCS 2005: 226-244
12	EE	Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
11	EE	Julia Chuzhoy, Yuval Rabani: Approximating k-median with non-uniform capacities. SODA 2005: 952-958
10	EE	Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233
9	EE	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor: Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005)
	2004
8	EE	Julia Chuzhoy, Joseph Naor: The Hardness of Metric Labeling. FOCS 2004: 108-114
7	EE	Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor: Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004: 81-90
6	EE	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor: Asymmetric k-center is log* n-hard to approximate. STOC 2004: 21-27
5	EE	Julia Chuzhoy, Joseph Naor: New hardness results for congestion minimization and machine scheduling. STOC 2004: 28-34
	2003
4	EE	Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor: Algorithmic Aspects of Bandwidth Trading. ICALP 2003: 751-766
3	EE	Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor: Asymmetric k-center is log*n-hard to Approximate Electronic Colloquium on Computational Complexity (ECCC)(038): (2003)
	2002
2	EE	Julia Chuzhoy, Joseph Naor: Covering Problems with Hard Capacities. FOCS 2002: 481-489
	2001
1		Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356

Coauthor Index

1	Matthew Andrews	[13] [23]
2	Mihai Badoiu	[10] [18]
3	Randeep Bhatia	[4] [24]
4	Deeparnab Chakrabarty	[33]
5	Tanmoy Chakraborty	[30]
6	Parinya Chalermsook	[34]
7	Chandra Chekuri	[20] [22]
8	Paolo Codenotti	[35]
9	Ari Freund	[4] [24]
10	Sudipto Guha	[3] [6] [7] [9]
11	Anupam Gupta	[12] [28]
12	Venkatesan Guruswami	[23] [26]
13	Eran Halperin	[6] [9]
14	Piotr Indyk	[10] [18]
15	Sanjeev Khanna	[3] [6] [7] [9] [13] [17] [19] [23] [25] [26] [27] [30] [31] [32] [33]
16	Guy Kortsarz	[6] [9]
17	Robert Krauthgamer	[9]
18	Liane Lewin-Eytan	[20] [22]
19	Joseph Naor (Seffi Naor)	[2] [3] [4] [5] [6] [7] [8] [9] [12] [14] [16] [20] [21] [22] [24] [28]
20	Ariel Orda	[20] [22]
21	Rafail Ostrovsky	[1] [15]
22	Yuval Rabani	[1] [11] [15]
23	Anastasios Sidiropoulos	[10] [18]
24	Amitabh Sinha	[12] [28]
25	Kunal Talwar	[23] [26]
26	Lisa Zhang	[13] [23]

Colors in the list of coauthors