On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. - Naveen Garg 001; Rohit Khandekar; Goran Konjevod; R. Ravi 001; F. Sibel Salman; Amitabh Sinha II (IPCO, 2001)

Local search heuristic for k-median and facility location problems. - Vijay Arya; Naveen Garg 001; Rohit Khandekar; Adam Meyerson; Kamesh Munagala; Vinayaka Pandit (STOC, 2001)

Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. - Naveen Garg 001; Rohit Khandekar (FOCS, 2002)

Bandwidth Maximization in Multicasting. - Naveen Garg 001; Rohit Khandekar; Keshav Kunal; Vinayaka Pandit (ESA, 2003)

An Efficient Central Path Algorithm for Virtual Navigation. - Parag Chaudhuri; Rohit Khandekar; Deepak Sethi; Prem Kalra (Computer Graphics International, 2004)

Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. - Naveen Garg 001; Rohit Khandekar (ESA, 2004)

Local Search Heuristics for k-Median and Facility Location Problems. - Vijay Arya; Naveen Garg 001; Rohit Khandekar; Adam Meyerson; Kamesh Munagala; Vinayaka Pandit (SIAM J. Comput., 2004)

Improved approximation for universal facility location. - Naveen Garg 001; Rohit Khandekar; Vinayaka Pandit (SODA, 2005)

Price of Anarchy, Locality Gap, and a Network Service Provider Game. - Nikhil R. Devanur; Naveen Garg 001; Rohit Khandekar; Vinayaka Pandit; Amin Saberi; Vijay V. Vazirani (WINE, 2005)

Offline Sorting Buffers on Line. - Rohit Khandekar; Vinayaka Pandit (ISAAC, 2006)

Online Sorting Buffers on Line. - Rohit Khandekar; Vinayaka Pandit (STACS, 2006)

Non-Preemptive Min-Sum Scheduling with Resource Augmentation. - Nikhil Bansal 001; Ho-Leung Chan; Rohit Khandekar; Kirk Pruhs; Clifford Stein 001; Baruch Schieber (FOCS, 2007)

Distributed network monitoring and multicommodity flows: a primal-dual approach. - Baruch Awerbuch; Rohit Khandekar (PODC, 2007)

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. - Baruch Awerbuch; Rohit Khandekar (PODC, 2007)

On cost sharing mechanisms in the network design game. - Baruch Awerbuch; Rohit Khandekar (PODC, 2007)

Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. - Baruch Awerbuch; Rohit Khandekar (LATIN, 2008)

Greedy distributed optimization of unsplittable multicommodity flows. - Baruch Awerbuch; Rohit Khandekar (PODC, 2008)

Stateless distributed algorithms for near optimal maximum multicommodity flows. - Baruch Awerbuch; Rohit Khandekar (PODC, 2008)

Fast load balancing via bounded best response. - Baruch Awerbuch; Yossi Azar; Rohit Khandekar (SODA, 2008)

Cost sharing mechanisms for near-optimal traffic aggregation and network design. - Baruch Awerbuch; Rohit Khandekar (SPAA, 2008)

A Fast and Simple Algorithm for Computing Market Equilibria. - Lisa Fleischer; Rahul Garg 001; Sanjiv Kapoor; Rohit Khandekar; Amin Saberi (WINE, 2008)

On the integrality ratio for tree augmentation. - Joseph Cheriyan; Howard J. Karloff; Rohit Khandekar; Jochen Könemann (Oper. Res. Lett., 2008)

On Hardness of Pricing Items for Single-Minded Bidders. - Rohit Khandekar; Tracy Kimbrel; Konstantin Makarychev; Maxim Sviridenko (APPROX-RANDOM, 2009)

Bounded Size Graph Clustering with Applications to Stream Processing. - Rohit Khandekar; Kirsten Hildrum; Sujay S. Parekh; Deepak Rajan; Jay Sethuraman; Joel L. Wolf (FSTTCS, 2009)

Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. - Rahul Garg 001; Rohit Khandekar (ICML, 2009)

COLA: Optimizing Stream Processing Applications via Graph Partitioning. - Rohit Khandekar; Kirsten Hildrum; Sujay S. Parekh; Deepak Rajan; Joel L. Wolf; Kun-Lung Wu; Henrique Andrade; Bugra Gedik (Middleware, 2009)

Brief announcement: Stateless distributed algorithms for generalized packing linear programs. - Baruch Awerbuch; Zhenghua Fu; Rohit Khandekar (PODC, 2009)

Greedy distributed optimization of multi-commodity flows. - Baruch Awerbuch; Rohit Khandekar (Distributed Comput., 2009)

Graph partitioning using single commodity flows. - Rohit Khandekar; Satish Rao; Umesh V. Vazirani (J. ACM, 2009)

Stateless Distributed Gradient Descent for Positive Linear Programs. - Baruch Awerbuch; Rohit Khandekar (SIAM J. Comput., 2009)

Additive Guarantees for Degree-Bounded Directed Network Design. - Nikhil Bansal 001; Rohit Khandekar; Viswanath Nagarajan (SIAM J. Comput., 2009)

Budgeted Red-Blue Median and Its Generalizations. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz (ESA (1), 2010)

Minimizing Busy Time in Multiple Machine Real-time Scheduling. - Rohit Khandekar; Baruch Schieber; Hadas Shachnai; Tami Tamir (FSTTCS, 2010)

FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads. - Joel L. Wolf; Deepak Rajan; Kirsten Hildrum; Rohit Khandekar; Vibhore Kumar; Sujay S. Parekh; Kun-Lung Wu; Andrey Balmin (Middleware, 2010)

Online and offline algorithms for the sorting buffers problem on the line metric. - Rohit Khandekar; Vinayaka Pandit (J. Discrete Algorithms, 2010)

Network-Design with Degree Constraints. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (APPROX-RANDOM, 2011)

Combinatorial Algorithms for Capacitated Network Design - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (CoRR, 2011)

Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso. - Rahul Garg 001; Rohit Khandekar (AISTATS, 2011)

Scheduling with Setup Costs and Monotone Penalties. - Rohit Khandekar; Kirsten Hildrum; Deepak Rajan; Joel L. Wolf (FSTTCS, 2012)

Clustering Streaming Graphs. - Ahmed Eldawy; Rohit Khandekar; Kun-Lung Wu (ICDCS, 2012)

Local Search Algorithms for the Red-Blue Median Problem. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz (Algorithmica, 2012)

CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans. - Joel L. Wolf; Andrey Balmin; Deepak Rajan; Kirsten Hildrum; Rohit Khandekar; Sujay S. Parekh; Kun-Lung Wu; Rares Vernica (ACM SIGOPS Oper. Syst. Rev., 2012)

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. - Baruch Awerbuch; Rohit Khandekar; Satish Rao (ACM Trans. Algorithms, 2012)

Prize-collecting steiner network problems. - Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2012)

The checkpoint problem. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Julián Mestre (Theor. Comput. Sci., 2012)

Approximating fault-tolerant group-Steiner problems. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (Theor. Comput. Sci., 2012)

On the optimization of schedules for MapReduce workloads in the presence of shared scans. - Joel L. Wolf; Andrey Balmin; Deepak Rajan; Kirsten Hildrum; Rohit Khandekar; Sujay S. Parekh; Kun-Lung Wu; Rares Vernica (VLDB J., 2012)

Two-stage Robust Network Design with Exponential Scenarios. - Rohit Khandekar; Guy Kortsarz; Vahab S. Mirrokni; Mohammad R. Salavatipour (Algorithmica, 2013)

The Foundations of Fixed Parameter Inapproximability. - Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz (CoRR, 2013)

IBM Streams Processing Language: Analyzing Big Data in motion. - Martin Hirzel; Henrique Andrade; Bugra Gedik; Gabriela Jacques-Silva; Rohit Khandekar; Vibhore Kumar; Mark P. Mendell; Howard Nasgaard; Scott Schneider 001; Robert Soulé; Kun-Lung Wu (IBM J. Res. Dev., 2013)

On some network design problems with degree constraints. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (J. Comput. Syst. Sci., 2013)

On generalizations of network design problems with degree bounds. - Nikhil Bansal 001; Rohit Khandekar; Jochen Könemann; Viswanath Nagarajan; Britta Peis (Math. Program., 2013)

A Distributed Algorithm for Large-Scale Generalized Matching. - Faraz Makari Manshadi; Baruch Awerbuch; Rainer Gemulla; Rohit Khandekar; Julián Mestre; Mauro Sozio (Proc. VLDB Endow., 2013)

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). - Rajesh Hemant Chitnis; Hossein Esfandiari; MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Saeed Seddighin (IPEC, 2014)

Fast Nearest Neighbor Search on Large Time-Evolving Graphs. - Leman Akoglu; Rohit Khandekar; Vibhore Kumar; Srinivasan Parthasarathy 002; Deepak Rajan; Kun-Lung Wu (ECML/PKDD (1), 2014)

On the Advantage of Overlapping Clusters for Minimizing Conductance. - Rohit Khandekar; Guy Kortsarz; Vahab S. Mirrokni (Algorithmica, 2014)

On a Local Protocol for Concurrent File Transfers. - Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Vahid Liaghat (Theory Comput. Syst., 2014)

A logarithmic approximation for unsplittable flow on line graphs. - Nikhil Bansal 001; Zachary Friggstad; Rohit Khandekar; Mohammad R. Salavatipour (ACM Trans. Algorithms, 2014)

Real-time scheduling to minimize machine busy times. - Rohit Khandekar; Baruch Schieber; Hadas Shachnai; Tami Tamir (J. Sched., 2015)

Dynamic Load Balancing for Ordered Data-Parallel Regions in Distributed Streaming Systems. - Scott Schneider 001; Joel L. Wolf; Kirsten Hildrum; Rohit Khandekar; Kun-Lung Wu (Middleware, 2016)

Bicovering: Covering edges with two small subsets of vertices. - Mohammad Taghi Hajiaghayi; Amey Bhangale; Rajiv Gandhi; Rohit Khandekar; Guy Kortsarz (Electron. Colloquium Comput. Complex., 2016)

On Fixed Cost k-Flow Problems. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (Theory Comput. Syst., 2016)

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. - Ron Adany; Moran Feldman; Elad Haramaty; Rohit Khandekar; Baruch Schieber; Roy Schwartz 002; Hadas Shachnai; Tami Tamir (ACM Trans. Algorithms, 2016)

A Simple and Efficient Algorithm for Computing Market Equilibria. - Lisa Fleischer; Rahul Garg 001; Sanjiv Kapoor; Rohit Khandekar; Amin Saberi (ACM Trans. Algorithms, 2016)

Approximation Algorithms for Movement Repairmen. - Mohammad Taghi Hajiaghayi; Rohit Khandekar; Mohammad Reza Khani; Guy Kortsarz (ACM Trans. Algorithms, 2016)

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. - Rajesh Chitnis; Hossein Esfandiari; Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Saeed Seddighin (Algorithmica, 2017)

Bi-Covering: Covering Edges with Two Small Subsets of Vertices. - Amey Bhangale; Rajiv Gandhi; Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz (SIAM J. Discret. Math., 2017)