Julia Chuzhoy

2007
22	EE	Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar: Hardness of routing with congestion in directed graphs. STOC 2007: 165-178
21	EE	Julia Chuzhoy, Sanjeev Khanna: Polynomial flow-cut gaps and hardness of directed cut problems. STOC 2007: 179-188
20	EE	Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor: Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms 3(1): (2007)
19	EE	Julia Chuzhoy, Joseph Naor: The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007)
2006
18	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
17	EE	Julia Chuzhoy, Sanjeev Khanna: Hardness of cut problems in directed graphs. STOC 2006: 527-536
16	EE	Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Embedding ultrametrics into low-dimensional spaces. Symposium on Computational Geometry 2006: 187-196
15	EE	Julia Chuzhoy, Joseph Naor: New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (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]
2	Mihai Badoiu	[10] [16]
3	Randeep Bhatia	[4] [20]
4	Chandra Chekuri	[18]
5	Ari Freund	[4] [20]
6	Sudipto Guha	[3] [6] [7] [9]
7	Anupam Gupta	[12]
8	Venkatesan Guruswami	[22]
9	Eran Halperin	[6] [9]
10	Piotr Indyk	[10] [16]
11	Sanjeev Khanna	[3] [6] [7] [9] [13] [17] [21] [22]
12	Guy Kortsarz	[6] [9]
13	Robert Krauthgamer	[9]
14	Liane Lewin-Eytan	[18]
15	Joseph Naor (Seffi Naor)	[2] [3] [4] [5] [6] [7] [8] [9] [12] [14] [15] [18] [19] [20]
16	Ariel Orda	[18]
17	Rafail Ostrovsky	[1]
18	Yuval Rabani	[1] [11]
19	Anastasios Sidiropoulos	[10] [16]
20	Amitabh Sinha	[12]
21	Kunal Talwar	[22]
22	Lisa Zhang	[13]