Rohit Khandekar

Publication Activity (10 Years)

Years Active: 2001-2017
Publications (10 Years): 9

Top Topics

Extended Abstract

Top Venues

ACM Trans. Algorithms

Theor. Comput. Sci.

Publications

Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31 (4) (2017)
Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77 (4) (2017)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58 (1) (2016)
Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. 23 (2016)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12 (3) (2016)
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12 (4) (2016)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12 (3) (2016)
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP (2016)
Scott Schneider, Joel L. Wolf, Kirsten Hildrum, Rohit Khandekar, Kun-Lung Wu
Dynamic Load Balancing for Ordered Data-Parallel Regions in Distributed Streaming Systems. Middleware (2016)
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR (2015)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Real-time scheduling to minimize machine busy times. J. Sched. 18 (6) (2015)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni
On the Advantage of Overlapping Clusters for Minimizing Conductance. Algorithmica 69 (4) (2014)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10 (1) (2014)
Leman Akoglu, Rohit Khandekar, Vibhore Kumar, Srinivasan Parthasarathy, Deepak Rajan, Kun-Lung Wu
Fast Nearest Neighbor Search on Large Time-Evolving Graphs. ECML/PKDD (1) (2014)
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat
On a Local Protocol for Concurrent File Transfers. Theory Comput. Syst. 55 (3) (2014)
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC (2014)
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
The Foundations of Fixed Parameter Inapproximability. CoRR (2013)
Martin Hirzel, Henrique Andrade, Bugra Gedik, Gabriela Jacques-Silva, Rohit Khandekar, Vibhore Kumar, Mark P. Mendell, Howard Nasgaard, Scott Schneider, Robert Soulé, Kun-Lung Wu
IBM Streams Processing Language: Analyzing Big Data in motion. IBM J. Res. Dev. 57 (3/4) (2013)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On generalizations of network design problems with degree bounds. Math. Program. 141 (1-2) (2013)
MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz
Approximation Algorithms for Movement Repairmen. APPROX-RANDOM (2013)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On Fixed Cost k-Flow Problems. WAOA (2013)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO (2013)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On some network design problems with degree constraints. J. Comput. Syst. Sci. 79 (5) (2013)
MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz
Approximation Algorithms for Movement Repairmen. CoRR (2013)
Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla, Rohit Khandekar, Julián Mestre, Mauro Sozio
A Distributed Algorithm for Large-Scale Generalized Matching. Proc. VLDB Endow. 6 (9) (2013)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65 (2) (2013)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63 (4) (2012)
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Prize-collecting steiner network problems. ACM Trans. Algorithms 9 (1) (2012)
Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf
Scheduling with Setup Costs and Monotone Penalties. FSTTCS (2012)
Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, Rares Vernica
On the optimization of schedules for MapReduce workloads in the presence of shared scans. VLDB J. 21 (5) (2012)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni
Advantage of Overlapping Clusters for Minimizing Conductance. LATIN (2012)
Ahmed Eldawy, Rohit Khandekar, Kun-Lung Wu
Clustering Streaming Graphs. ICDCS (2012)
Baruch Awerbuch, Rohit Khandekar, Satish Rao
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms 9 (1) (2012)
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. ACM SIGOPS Oper. Syst. Rev. 46 (1) (2012)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
The checkpoint problem. Theor. Comput. Sci. 452 (2012)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416 (2012)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat
On a local protocol for concurrent file transfers. SPAA (2011)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Combinatorial Algorithms for Capacitated Network Design CoRR (2011)
Rahul Garg, Rohit Khandekar
Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso. AISTATS (2011)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Network-Design with Degree Constraints. APPROX-RANDOM (2011)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
Budgeted Red-Blue Median and Its Generalizations. ESA (1) (2010)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Prize-Collecting Steiner Network Problems. IPCO (2010)
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)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
The Checkpoint Problem. APPROX-RANDOM (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds CoRR (2010)
Rohit Khandekar, Vinayaka Pandit
Online and offline algorithms for the sorting buffers problem on the line metric. J. Discrete Algorithms 8 (1) (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds. IPCO (2010)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS (2010)
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
Graph partitioning using single commodity flows. J. ACM 56 (4) (2009)
Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar
Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC (2009)
Baruch Awerbuch, Rohit Khandekar
Stateless Distributed Gradient Descent for Positive Linear Programs. SIAM J. Comput. 38 (6) (2009)
Rahul Garg, Rohit Khandekar
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. ICML (2009)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS (2009)
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)
Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM (2009)
Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan
Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39 (4) (2009)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. SODA (2009)
Baruch Awerbuch, Rohit Khandekar
Greedy distributed optimization of multi-commodity flows. Distributed Comput. 21 (5) (2009)
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf
Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS (2009)
Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann
On the integrality ratio for tree augmentation. Oper. Res. Lett. 36 (4) (2008)
Baruch Awerbuch, Rohit Khandekar
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN (2008)
Baruch Awerbuch, Rohit Khandekar
Stateless distributed algorithms for near optimal maximum multicommodity flows. PODC (2008)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Fast and Simple Algorithm for Computing Market Equilibria. WINE (2008)
Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan
Additive guarantees for degree bounded directed network design. STOC (2008)
Baruch Awerbuch, Rohit Khandekar
Greedy distributed optimization of unsplittable multicommodity flows. PODC (2008)
Baruch Awerbuch, Rohit Khandekar
Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA (2008)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
Two-Stage Robust Network Design with Exponential Scenarios. ESA (2008)
Baruch Awerbuch, Rohit Khandekar
Stateless distributed gradient descent for positive linear programs. STOC (2008)
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
Fast load balancing via bounded best response. SODA (2008)
Baruch Awerbuch, Rohit Khandekar
On cost sharing mechanisms in the network design game. PODC (2007)
Baruch Awerbuch, Rohit Khandekar, Satish Rao
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA (2007)
Baruch Awerbuch, Rohit Khandekar
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC (2007)
Baruch Awerbuch, Rohit Khandekar
Greedy distributed optimization of multi-commodity flows. PODC (2007)
Baruch Awerbuch, Rohit Khandekar
Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC (2007)
Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS (2007)
Rohit Khandekar, Vinayaka Pandit
Online Sorting Buffers on Line. STACS (2006)
Rohit Khandekar, Vinayaka Pandit
Offline Sorting Buffers on Line. ISAAC (2006)
Rohit Khandekar, Satish Rao, Umesh V. Vazirani
Graph partitioning using single commodity flows. STOC (2006)
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)
Naveen Garg, Rohit Khandekar, Vinayaka Pandit
Improved approximation for universal facility location. SODA (2005)
Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra
An Efficient Central Path Algorithm for Virtual Navigation. Computer Graphics International (2004)
Naveen Garg, Rohit Khandekar
Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. ESA (2004)
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) (2004)
Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit
Bandwidth Maximization in Multicasting. ESA (2003)
Naveen Garg, Rohit Khandekar
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. FOCS (2002)
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)
Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
Local search heuristic for k-median and facility location problems. STOC (2001)