Anupam Gupta

	2009
87		Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162
86		Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Approximate clustering without the approximation. SODA 2009: 1068-1077
85		Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar: Secretary problems: weights and discounts. SODA 2009: 1245-1254
84		Anupam Gupta, Amit Kumar: A constant-factor approximation for stochastic Steiner forest. STOC 2009: 659-668
83		Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and stochastic survivable network design. STOC 2009: 685-694
82		Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Approximation Algorithms CoRR abs/0903.4510: (2009)
81		Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers CoRR abs/0906.2020: (2009)
80		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-Min Optimization CoRR abs/0912.1045: (2009)
79		T.-H. Hubert Chan, Anupam Gupta: Small Hop-diameter Sparse Spanners for Doubling Metrics. Discrete & Computational Geometry 41(1): 28-44 (2009)
78		T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
	2008
77		Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356
76		Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan: All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008: 199-210
75		Anupam Gupta, Kunal Talwar: How to Complete a Doubling Metric. LATIN 2008: 36-47
74		Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A plant location guide for the unsure. SODA 2008: 1164-1173
73		T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. SODA 2008: 333-342
72		Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
71		T.-H. Hubert Chan, Anupam Gupta: Approximating TSP on metrics with bounded global growth. SODA 2008: 690-699
70		Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski: Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951
69		Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms 4(2): (2008)
68		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2): (2008)
67		Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008)
66		Anupam Gupta, Kanat Tangwongsan: Simpler Analyses of Local Search Algorithms for Facility Location CoRR abs/0809.2554: (2008)
65		Anupam Gupta, Ziv Bar-Joseph: Extracting Dynamics from Static Cancer Expression Data. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 172-182 (2008)
	2007
64		Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148
63		Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi: On Configuring BGP Route Reflectors. COMSWARE 2007
62		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252
61		Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi: Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509
60		Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor: An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533
59		Barbara M. Anthony, Anupam Gupta: Infrastructure Leasing Problems. IPCO 2007: 424-438
58		Andreas Krause, H. Brendan McMahan, Carlos Guestrin, Anupam Gupta: Selecting Observations against Adversarial Objectives. NIPS 2007
57		Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
56		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007)
55		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest CoRR abs/0707.0648: (2007)
54		Anupam Gupta, Kunal Talwar: How to Complete a Doubling Metric CoRR abs/0712.3331: (2007)
53		Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007)
52		Anupam Gupta, R. Ravi, Amitabh Sinha: LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007)
	2006
51		Hubert T.-H. Chan, Michael Dinitz, Anupam Gupta: Spanners with Slack. ESA 2006: 196-207
50		Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN 2006: 2-10
49		Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks: minimizing network congestion. PODC 2006: 16-25
48		Kedar Dhamdhere, Anupam Gupta, Harald Räcke: Improved embeddings of graph metrics into random trees. SODA 2006: 61-69
47		Hubert T.-H. Chan, Anupam Gupta: Small hop-diameter sparse spanners for doubling metrics. SODA 2006: 70-78
46		Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke: Oblivious network design. SODA 2006: 970-979
45		Anupam Gupta, Kunal Talwar: Approximating unique games. SODA 2006: 99-106
44		Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-Outerplanar Graphs into l 1. SIAM J. Discrete Math. 20(1): 119-136 (2006)
43		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006)
42		Anupam Gupta, Aravind Srinivasan: An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing 2(1): 53-64 (2006)
	2005
41		Anupam Gupta, Amit Kumar: Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM 2005: 74-85
40		Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98
39		Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
38		Anupam Gupta, Martin Pál: Stochastic Steiner Trees Without a Root. ICALP 2005: 1051-1063
37		Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks to minimize access delays. PODC 2005: 87-96
36		Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111
35		Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128
34		Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou: On hierarchical routing in doubling metrics. SODA 2005: 762-771
33		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
32		Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005)
31		Chandra Chekuri, Anupam Gupta, Amit Kumar: On a bidirected relaxation for the MULTIWAY CUT problem. Discrete Applied Mathematics 150(1-3): 67-79 (2005)
	2004
30		Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150
29		Anupam Gupta, R. Ravi, Amitabh Sinha: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227
28		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245
27		Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426
26		Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. Combinatorica 24(2): 233-269 (2004)
25		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. 34(2): 453-474 (2004)
	2003
24		Anupam Gupta, Robert Krauthgamer, James R. Lee: Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS 2003: 534-543
23		Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606-
22		Anupam Gupta, Aravind Srinivasan: On the Covering Steiner Problem. FSTTCS 2003: 244-251
21		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM 2003
20		Anupam Gupta, Francis Zane: Counting inversions in lists. SODA 2003: 253-254
19		Anupam Gupta: Improved results for directed multicut. SODA 2003: 454-455
18		Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
17		Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-outerplanar graphs into l1. SODA 2003: 527-536
16		Anupam Gupta, Amit Kumar, Mikkel Thorup: Tree based MPLS routing. SPAA 2003: 193-199
15		Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
14		Sanjoy Dasgupta, Anupam Gupta: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1): 60-65 (2003)
	2002
13		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66
12		Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
11		Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. IPCO 2002: 439-456
	2001
10		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS 2001: 148-157
9		Anupam Gupta, Amit Kumar: Sorting and Selection with Structured Costs. FOCS 2001: 416-425
8		Anupam Gupta: Steiner points in tree metrics don't (really) help. SODA 2001: 220-227
7		Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener: Provisioning a virtual private network: a network design problem for multicommodity flow. STOC 2001: 389-398
6		Anupam Gupta: Improved Bandwidth Approximation for Trees and Chordal Graphs. J. Algorithms 40(1): 24-36 (2001)
	2000
5		Anupam Gupta: Improved bandwidth approximation for trees. SODA 2000: 788-793
4		Anupam Gupta, Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658
3		Anupam Gupta: Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. Discrete & Computational Geometry 24(1): 105-116 (2000)
	1999
2		Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409
1		Anupam Gupta: Embedding Tree Metrics Into Low Dimensional Euclidean Spaces. STOC 1999: 694-700

Coauthor Index

1	Ittai Abraham	[39]
2	Alexandr Andoni	[18]
3	Barbara M. Anthony	[59] [74]
4	Moshe Babaioff	[85]
5	Mihai Badoiu	[35]
6	Maria-Florina Balcan (Maria-Florina Popa)	[86]
7	Nikhil Bansal	[60]
8	Ziv Bar-Joseph	[65]
9	Yair Bartal	[39]
10	Avrim Blum	[86]
11	Yuri Breitbart	[63]
12	Niv Buchbinder	[60]
13	Amit Chakrabarti	[13] [56]
14	T.-H. Hubert Chan (Hubert T.-H. Chan)	[34] [39] [47] [51] [71] [73] [78] [79]
15	Shuchi Chawla	[36] [69]
16	Chandra Chekuri	[11] [13] [17] [31] [32] [44] [56] [72]
17	Julia Chuzhoy	[33] [68]
18	Sanjoy Dasgupta	[14]
19	Michel Deza	[18]
20	Kedar Dhamdhere	[28] [35] [39] [43] [48] [78]
21	Michael Dinitz	[51] [85]
22	Guy Even	[72]
23	Naveen Garg	[70]
24	Minos N. Garofalakis	[63]
25	Daniel Golovin	[49] [76]
26	Vineet Goyal	[61] [74]
27	Fabrizio Grandoni	[77]
28	Carlos Guestrin	[50] [58]
29	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[46] [55] [62] [64]
30	Nicole Immorlica	[85]
31	Piotr Indyk	[18]
32	Jon M. Kleinberg	[7] [39] [50] [78]
33	Jochen Könemann	[57]
34	Andreas Krause	[50] [58]
35	Robert Krauthgamer	[24]
36	Ravishankar Krishnaswamy	[81] [83] [87]
37	Amit Kumar	[7] [9] [10] [11] [12] [13] [15] [16] [21] [23] [25] [31] [32] [41] [53] [56] [63] [64] [76] [81] [84] [87]
38	James R. Lee	[24]
39	Stefano Leonardi	[57] [61] [70] [77]
40	Katrina Ligett	[82]
41	Bruce M. Maggs	[34] [37] [49]
42	H. Brendan McMahan	[58]
43	Frank McSherry	[82]
44	Pauli Miettinen	[77]
45	Viswanath Nagarajan	[55] [62] [74] [80]
46	Joseph Naor (Seffi Naor)	[11] [32] [33] [60] [68]
47	Ofer Neiman	[39]
48	Ilan Newman	[2] [17] [26] [44]
49	Florian Oprea	[37] [49]
50	Martin Pál (Martin Pal)	[23] [27] [38] [40] [53]
51	Yuri Rabinovich	[2] [17] [26] [35] [44]
52	Harald Räcke	[35] [36] [46] [48] [69]
53	Sofya Raskhodnikova	[18]
54	Rajeev Rastogi	[7] [10] [21] [25] [63]
55	R. Ravi	[27] [28] [29] [35] [40] [43] [52] [55] [57] [61] [62] [80] [83]
56	Danny Raz	[11] [32]
57	Michael K. Reiter	[37] [49]
58	Aaron Roth	[82]
59	Tim Roughgarden	[12] [15] [23] [53]
60	Piotr Sankowski	[70] [77]
61	Guido Schäfer	[57]
62	Danny Segev	[72] [81] [87]
63	Anastasios Sidiropoulos	[35]
64	Alistair Sinclair	[2] [17] [26] [44]
65	Mohit Singh	[77]
66	Amitabh Sinha	[27] [29] [33] [40] [52] [68]
67	Aleksandrs Slivkins	[39] [78]
68	Aravind Srinivasan	[22] [30] [42] [67]
69	Kunal Talwar	[45] [54] [73] [75] [82] [85]
70	Kanat Tangwongsan	[66] [76]
71	Éva Tardos	[4] [30] [67]
72	Mikkel Thorup	[16]
73	Bülent Yener	[7]
74	Francis Zane	[20]
75	Shuheng Zhou	[34]

Colors in the list of coauthors