default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRohit Khandekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j29]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): 1216-1239 (2017)- [j28]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): 2626-2646 (2017) - 2016
- [j27]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58(1): 4-18 (2016) - [j26]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12(3): 34:1-34:15 (2016) - [j25]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): 38:1-38:25 (2016) - [j24]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12(4): 54:1-54:38 (2016) - [c52]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP 2016: 6:1-6:12 - [c51]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: 21 - [i6]Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j23]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. J. Sched. 18(6): 561-573 (2015) - [i5]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 abs/1506.03760 (2015) - 2014
- [j22]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
On the Advantage of Overlapping Clusters for Minimizing Conductance. Algorithmica 69(4): 844-863 (2014) - [j21]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a Local Protocol for Concurrent File Transfers. Theory Comput. Syst. 55(3): 613-636 (2014) - [j20]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10(1): 1:1-1:15 (2014) - [c50]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: 159-171 - [c49]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: 17-33 - 2013
- [j19]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013) - [j18]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): 7 (2013) - [j17]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On some network design problems with degree constraints. J. Comput. Syst. Sci. 79(5): 725-736 (2013) - [j16]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): 479-506 (2013) - [j15]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): 613-624 (2013) - [c48]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. APPROX-RANDOM 2013: 218-232 - [c47]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: 13-24 - [c46]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. WAOA 2013: 49-60 - [i4]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. CoRR abs/1306.3739 (2013) - [i3]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
The Foundations of Fixed Parameter Inapproximability. CoRR abs/1310.2711 (2013) - 2012
- [j14]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012) - [j13]Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay S. Parekh, Kun-Lung Wu, Rares Vernica:
CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans. ACM SIGOPS Oper. Syst. Rev. 46(1): 26-32 (2012) - [j12]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-collecting steiner network problems. ACM Trans. Algorithms 9(1): 2:1-2:13 (2012) - [j11]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms 9(1): 3:1-3:14 (2012) - [j10]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416: 55-64 (2012) - [j9]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012) - [j8]Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay S. Parekh, Kun-Lung Wu, Rares Vernica:
On the optimization of schedules for MapReduce workloads in the presence of shared scans. VLDB J. 21(5): 589-609 (2012) - [c45]Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf:
Scheduling with Setup Costs and Monotone Penalties. FSTTCS 2012: 185-198 - [c44]Ahmed Eldawy, Rohit Khandekar, Kun-Lung Wu:
Clustering Streaming Graphs. ICDCS 2012: 466-475 - [c43]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505 - 2011
- [c42]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301 - [c41]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. SPAA 2011: 269-278 - [c40]Rahul Garg, Rohit Khandekar:
Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso. AISTATS 2011: 296-304 - [i2]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) - 2010
- [j7]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) - [c39]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The Checkpoint Problem. APPROX-RANDOM 2010: 219-231 - [c38]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325 - [c37]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180 - [c36]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 - [c35]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - [c34]Joel L. Wolf, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Vibhore Kumar, Sujay S. Parekh, Kun-Lung Wu, Andrey Balmin:
FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads. Middleware 2010: 1-20 - [i1]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)
2000 – 2009
- 2009
- [j6]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. Distributed Comput. 21(5): 317-329 (2009) - [j5]Rohit Khandekar, Satish Rao, Umesh V. Vazirani:
Graph partitioning using single commodity flows. J. ACM 56(4): 19:1-19:15 (2009) - [j4]Baruch Awerbuch, Rohit Khandekar:
Stateless Distributed Gradient Descent for Positive Linear Programs. SIAM J. Comput. 38(6): 2468-2486 (2009) - [j3]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009) - [c33]Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko:
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216 - [c32]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274 - [c31]Rohit Khandekar, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf:
Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS 2009: 275-286 - [c30]Rahul Garg, Rohit Khandekar:
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. ICML 2009: 337-344 - [c29]Rohit Khandekar, Kirsten Hildrum, Sujay S. 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 - [c28]Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar:
Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC 2009: 270-271 - [c27]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709 - 2008
- [j2]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) - [c26]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600 - [c25]Baruch Awerbuch, Rohit Khandekar:
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN 2008: 580-592 - [c24]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of unsplittable multicommodity flows. PODC 2008: 439 - [c23]Baruch Awerbuch, Rohit Khandekar:
Stateless distributed algorithms for near optimal maximum multicommodity flows. PODC 2008: 440 - [c22]Baruch Awerbuch, Yossi Azar, Rohit Khandekar:
Fast load balancing via bounded best response. SODA 2008: 314-322 - [c21]Baruch Awerbuch, Rohit Khandekar:
Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA 2008: 85-90 - [c20]Baruch Awerbuch, Rohit Khandekar:
Stateless distributed gradient descent for positive linear programs. STOC 2008: 691-700 - [c19]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive guarantees for degree bounded directed network design. STOC 2008: 769-778 - [c18]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 - 2007
- [c17]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 - [c16]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. PODC 2007: 274-283 - [c15]Baruch Awerbuch, Rohit Khandekar:
Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC 2007: 284-291 - [c14]Baruch Awerbuch, Rohit Khandekar:
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC 2007: 354-355 - [c13]Baruch Awerbuch, Rohit Khandekar:
On cost sharing mechanisms in the network design game. PODC 2007: 364-365 - [c12]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957 - 2006
- [c11]Rohit Khandekar, Vinayaka Pandit:
Offline Sorting Buffers on Line. ISAAC 2006: 81-89 - [c10]Rohit Khandekar, Vinayaka Pandit:
Online Sorting Buffers on Line. STACS 2006: 584-595 - [c9]Rohit Khandekar, Satish Rao, Umesh V. Vazirani:
Graph partitioning using single commodity flows. STOC 2006: 385-390 - 2005
- [c8]Naveen Garg, Rohit Khandekar, Vinayaka Pandit:
Improved approximation for universal facility location. SODA 2005: 959-960 - [c7]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
- [j1]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) - [c6]Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra:
An Efficient Central Path Algorithm for Virtual Navigation. Computer Graphics International 2004: 188-195 - [c5]Naveen Garg, Rohit Khandekar:
Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. ESA 2004: 371-382 - 2003
- [c4]Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit:
Bandwidth Maximization in Multicasting. ESA 2003: 242-253 - 2002
- [c3]Naveen Garg, Rohit Khandekar:
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. FOCS 2002: 500- - 2001
- [c2]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 - [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
