Kanthi K. Sarpatwar  Kanthi K. Sarpatwar photo       

contact information

Research Staff Member
Thomas J. Watson Research Center, Yorktown Heights, NY USA



Dealing with Time-Windows in All-or-Nothing GAP and Preemptive Scheduling
Kanthi K. Sarpatwar, Baruch Schieber and Hadas Shachnai
Submitted, 2017

Interleaved Algorithms for Constrained Submodular Function Maximization.
Kanthi K. Sarpatwar, Baruch Schieber and Hadas Shachnai
Submittted, 2017

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice
Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu
AAMAS, 2017

On Maximum Leaf Trees and Connections to Connected Maximum Cut Problems.
Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar
Information Processing Letters, 2017


The Container Selection Problem
Viswanath Nagarajan, Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai and Joel Wolf
APPROX, 2015

Approximation Algorithms for Connected Maximum Cut and Related Problems
Mohammadtaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit and Kanthi Sarpatwar
European Symposium on Algorithms (ESA), 2015


The X-Flex Cross-Platform Scheduler: Who's The Fairest Of Them All?
Joel Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring and Kanthi Sarpatwar
ACM/IFIP/USENIX Middleware 2014 - Industry Track.

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
Symposium on Discrete Algorithms (SODA), 2014


New Approximation Results for Resource Replication Problems
Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
APPROX-RANDOM (Also in Algorithmica), 2012


Hardness of Subgraph and Supergraph Problems in r-tournaments
Kanthi K. Sarpatwar, Narayanaswamy N. S.
Theoretical Computer Science (TCS), 2011

Rainbow Connectivity; Hardness and Tractability
Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011

Year Unknown

Improved Algorithms for Steiner Tree and Cheapest Tour Oracles
Randeep Bhatia, Bhawna Gupta, Kanthi K. Sarpatwar

Approximation Algorithms for Covering Problems in Energy Constrained Wireless Networks
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar