Julia Chuzhoy

	2012
51		Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou: Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799
50		Julia Chuzhoy: On vertex sparsifiers with Steiner nodes. STOC 2012: 673-688
49		Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li: Approximation algorithms and hardness of integral concurrent flow. STOC 2012: 689-708
48		Julia Chuzhoy: Routing in undirected graphs with constant congestion. STOC 2012: 855-874
47		Julia Chuzhoy: On Vertex Sparsifiers with Steiner Nodes CoRR abs/1204.2844: (2012)
	2011
46		Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos: On Graph Crossing Number and Edge Planarization. SODA 2011: 1050-1069
45		Julia Chuzhoy: An algorithm for the graph crossing number problem. STOC 2011: 303-312
44		Julia Chuzhoy: Routing in Undirected Graphs with Constant Congestion CoRR abs/1107.2554: (2011)
43		Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou: Approximation Algorithms and Hardness of the k-Route Cut Problem CoRR abs/1112.3611: (2011)
	2010
42		MohammadHossein Bateni, Julia Chuzhoy: Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. APPROX-RANDOM 2010: 25-38
41		Parinya Chalermsook, Julia Chuzhoy: Resource Minimization for Fire Containment. SODA 2010: 1334-1349
40		Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos: On Graph Crossing Number and Edge Planarization CoRR abs/1010.3976: (2010)
39		Julia Chuzhoy: An Algorithm for the Graph Crossing Number Problem CoRR abs/1012.0255: (2010)
38		Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang: Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Combinatorica 30(5): 485-520 (2010)
	2009
37		Julia Chuzhoy, Paolo Codenotti: Resource Minimization Job Scheduling. APPROX-RANDOM 2009: 70-83
36		Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness. FOCS 2009: 107-116
35		Julia Chuzhoy, Sanjeev Khanna: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. FOCS 2009: 437-441
34		Parinya Chalermsook, Julia Chuzhoy: Maximum independent set of rectangles. SODA 2009: 892-901
33		Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness CoRR abs/0901.0205: (2009)
32		Julia Chuzhoy, Sanjeev Khanna: Polynomial flow-cut gaps and hardness of directed cut problems. J. ACM 56(2): (2009)
	2008
31		Julia Chuzhoy, Sanjeev Khanna: Algorithms for Single-Source Vertex Connectivity. FOCS 2008: 105-114
30		Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna: Network design for vertex connectivity. STOC 2008: 167-176
29		Julia Chuzhoy: Generalized Steiner Network. Encyclopedia of Algorithms 2008
28		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2): (2008)
27		Julia Chuzhoy, Sanjeev Khanna: An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design CoRR abs/0812.4442: (2008)
	2007
26		Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar: Hardness of routing with congestion in directed graphs. STOC 2007: 165-178
25		Julia Chuzhoy, Sanjeev Khanna: Polynomial flow-cut gaps and hardness of directed cut problems. STOC 2007: 179-188
24		Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor: Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms 3(1): (2007)
23		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		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		Julia Chuzhoy, Joseph Naor: The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007)
	2006
20		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		Julia Chuzhoy, Sanjeev Khanna: Hardness of cut problems in directed graphs. STOC 2006: 527-536
18		Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Embedding ultrametrics into low-dimensional spaces. Symposium on Computational Geometry 2006: 187-196
17		Julia Chuzhoy, Sanjeev Khanna: Hardness of Directed Routing with Congestion. Electronic Colloquium on Computational Complexity (ECCC) 13(109): (2006)
16		Julia Chuzhoy, Joseph Naor: New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006)
15		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		Julia Chuzhoy, Joseph Naor: Covering Problems with Hard Capacities. SIAM J. Comput. 36(2): 498-515 (2006)
	2005
13		Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang: Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. FOCS 2005: 226-244
12		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
11		Julia Chuzhoy, Yuval Rabani: Approximating k-median with non-uniform capacities. SODA 2005: 952-958
10		Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233
9		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		Julia Chuzhoy, Joseph Naor: The Hardness of Metric Labeling. FOCS 2004: 108-114
7		Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor: Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004: 81-90
6		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		Julia Chuzhoy, Joseph Naor: New hardness results for congestion minimization and machine scheduling. STOC 2004: 28-34
	2003
4		Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor: Algorithmic Aspects of Bandwidth Trading. ICALP 2003: 751-766
3		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		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] [38]
2	Mihai Badoiu	[10] [18]
3	MohammadHossein Bateni	[42]
4	Randeep Bhatia	[4] [24]
5	Deeparnab Chakrabarty	[33] [36]
6	Tanmoy Chakraborty	[30]
7	Parinya Chalermsook	[34] [41] [49]
8	Chandra Chekuri	[20] [22]
9	Paolo Codenotti	[37]
10	Alina Ene	[49]
11	Ari Freund	[4] [24]
12	Sudipto Guha	[3] [6] [7] [9]
13	Anupam Gupta	[12] [28]
14	Venkatesan Guruswami	[23] [26] [38]
15	Eran Halperin	[6] [9]
16	Piotr Indyk	[10] [18]
17	Sanjeev Khanna	[3] [6] [7] [9] [13] [17] [19] [23] [25] [26] [27] [30] [31] [32] [33] [35] [36] [38]
18	Guy Kortsarz	[6] [9]
19	Robert Krauthgamer	[9]
20	Liane Lewin-Eytan	[20] [22]
21	Shi Li	[49]
22	Yury Makarychev	[40] [43] [46] [51]
23	Joseph Naor (Seffi Naor)	[2] [3] [4] [5] [6] [7] [8] [9] [12] [14] [16] [20] [21] [22] [24] [28]
24	Ariel Orda	[20] [22]
25	Rafail Ostrovsky	[1] [15]
26	Yuval Rabani	[1] [11] [15]
27	Anastasios Sidiropoulos	[10] [18] [40] [46]
28	Amitabh Sinha	[12] [28]
29	Kunal Talwar	[23] [26] [38]
30	Aravindan Vijayaraghavan	[43] [51]
31	Lisa Zhang	[13] [23] [38]
32	Yuan Zhou	[43] [51]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page