Rohit Khandekar

	2012
55		Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni: Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505
54		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012)
53		Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, Rares Vernica: CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans. Operating Systems Review 46(1): 26-32 (2012)
52		Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416: 55-64 (2012)
	2011
51		Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301
50		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat: On a local protocol for concurrent file transfers. SPAA 2011: 269-278
49		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Combinatorial Algorithms for Capacitated Network Design CoRR abs/1108.1176: (2011)
48		Rahul Garg, Rohit Khandekar: Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso. Journal of Machine Learning Research - Proceedings Track 15: 296-304 (2011)
	2010
47		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The Checkpoint Problem. APPROX-RANDOM 2010: 219-231
46		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325
45		Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir: Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180
44		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123
43		MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84
42		Joel L. Wolf, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Vibhore Kumar, Sujay Parekh, Kun-Lung Wu, Andrey Balmin: FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads. Middleware 2010: 1-20
41		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds CoRR abs/1003.2977: (2010)
40		Rohit Khandekar, Vinayaka Pandit: Online and offline algorithms for the sorting buffers problem on the line metric. J. Discrete Algorithms 8(1): 24-35 (2010)
	2009
39		Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko: On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216
38		Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274
37		Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf: Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS 2009: 275-286
36		Rahul Garg, Rohit Khandekar: Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. ICML 2009: 43
35		Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Joel L. Wolf, Kun-Lung Wu, Henrique Andrade, Bugra Gedik: COLA: Optimizing Stream Processing Applications via Graph Partitioning. Middleware 2009: 308-327
34		Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar: Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC 2009: 270-271
33		Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour: A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709
32		Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of multi-commodity flows. Distributed Computing 21(5): 317-329 (2009)
31		Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. J. ACM 56(4): (2009)
30		Baruch Awerbuch, Rohit Khandekar: Stateless Distributed Gradient Descent for Positive Linear Programs. SIAM J. Comput. 38(6): 2468-2486 (2009)
29		Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009)
	2008
28		Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600
27		Baruch Awerbuch, Rohit Khandekar: Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN 2008: 580-592
26		Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of unsplittable multicommodity flows. PODC 2008: 439
25		Baruch Awerbuch, Rohit Khandekar: Stateless distributed algorithms for near optimal maximum multicommodity flows. PODC 2008: 440
24		Baruch Awerbuch, Yossi Azar, Rohit Khandekar: Fast load balancing via bounded best response. SODA 2008: 314-322
23		Baruch Awerbuch, Rohit Khandekar: Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA 2008: 85-90
22		Baruch Awerbuch, Rohit Khandekar: Stateless distributed gradient descent for positive linear programs. STOC 2008: 691-700
21		Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive guarantees for degree bounded directed network design. STOC 2008: 769-778
20		Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30
19		Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008)
	2007
18		Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber: Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624
17		Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of multi-commodity flows. PODC 2007: 274-283
16		Baruch Awerbuch, Rohit Khandekar: Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC 2007: 284-291
15		Baruch Awerbuch, Rohit Khandekar: Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC 2007: 354-355
14		Baruch Awerbuch, Rohit Khandekar: On cost sharing mechanisms in the network design game. PODC 2007: 364-365
13		Baruch Awerbuch, Rohit Khandekar, Satish Rao: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957
	2006
12		Rohit Khandekar, Vinayaka Pandit: Offline Sorting Buffers on Line. ISAAC 2006: 81-89
11		Rohit Khandekar, Vinayaka Pandit: Online Sorting Buffers on Line. STACS 2006: 584-595
10		Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. STOC 2006: 385-390
	2005
9		Naveen Garg, Rohit Khandekar, Vinayaka Pandit: Improved approximation for universal facility location. SODA 2005: 959-960
8		Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani: Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055
	2004
7		Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra: An Efficient Central Path Algorithm for Virtual Navigation. Computer Graphics International 2004: 188-195
6		Naveen Garg, Rohit Khandekar: Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. ESA 2004: 371-382
5		Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local Search Heuristics for k-Median and Facility Location Problems. SIAM J. Comput. 33(3): 544-562 (2004)
	2003
4		Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit: Bandwidth Maximization in Multicasting. ESA 2003: 242-253
	2002
3		Naveen Garg, Rohit Khandekar: Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. FOCS 2002: 500-
	2001
2		Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II: On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. IPCO 2001: 170-184
1		Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local search heuristic for k-median and facility location problems. STOC 2001: 21-29

Coauthor Index

1	Henrique Andrade	[35]
2	Vijay Arya	[1] [5]
3	Baruch Awerbuch	[13] [14] [15] [16] [17] [22] [23] [24] [25] [26] [27] [30] [32] [34]
4	Yossi Azar	[24]
5	Andrey Balmin	[42] [53]
6	Nikhil Bansal	[18] [21] [29] [33] [41] [44]
7	Ho-Leung Chan	[18]
8	Parag Chaudhuri	[7]
9	Joseph Cheriyan	[19]
10	Nikhil R. Devanur	[8]
11	Lisa Fleischer	[20]
12	Zachary Friggstad	[33]
13	Zhenghua Fu	[34]
14	Naveen Garg	[1] [2] [3] [4] [5] [6] [8] [9]
15	Rahul Garg	[20] [36] [48]
16	Bugra Gedik	[35]
17	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[43] [46] [47] [49] [50] [54]
18	Kirsten Hildrum (Kris Hildrum)	[35] [37] [42] [53]
19	Prem Kumar Kalra (Prem Kalra)	[7]
20	Sanjiv Kapoor	[20]
21	Howard J. Karloff	[19]
22	Tracy Kimbrel	[39]
23	Jochen Könemann	[19] [41] [44]
24	Goran Konjevod	[2]
25	Guy Kortsarz	[28] [38] [43] [46] [47] [49] [50] [51] [52] [54] [55]
26	Vibhore Kumar	[42]
27	Keshav Kunal	[4]
28	Vahid Liaghat	[50]
29	Konstantin Makarychev	[39]
30	Julián Mestre	[47]
31	Adam Meyerson	[1] [5]
32	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[28] [55]
33	Kamesh Munagala	[1] [5]
34	Viswanath Nagarajan	[21] [29] [41] [44]
35	Zeev Nutov	[38] [43] [49] [51] [52]
36	Vinayaka Pandit	[1] [4] [5] [8] [9] [11] [12] [40]
37	Sujay Parekh	[35] [37] [42] [53]
38	Britta Peis	[41] [44]
39	Kirk Pruhs	[18]
40	Deepak Rajan	[35] [37] [42] [53]
41	Satish Rao	[10] [13] [31]
42	R. Ravi	[2]
43	Amin Saberi	[8] [20]
44	Mohammad R. Salavatipour	[28] [33]
45	F. Sibel Salman	[2]
46	Baruch Schieber	[18] [45]
47	Deepak Sethi	[7]
48	Jay Sethuraman	[37]
49	Hadas Shachnai	[45]
50	Amitabh Sinha II	[2]
51	Clifford Stein	[18]
52	Maxim Sviridenko	[39]
53	Tami Tamir	[45]
54	Umesh V. Vazirani	[10] [31]
55	Vijay V. Vazirani	[8]
56	Rares Vernica	[53]
57	Joel L. Wolf	[35] [37] [42] [53]
58	Kun-Lung Wu	[35] [42] [53]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page