Rainbow Connectivity: Hardness and Tractability. - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (FSTTCS, 2011)

Hardness and Parameterized Algorithms on Rainbow Connectivity problem - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (CoRR, 2011)

Hardness of subgraph and supergraph problems in c-tournaments. - S. Kanthi Kiran; N. S. Narayanaswamy (Theor. Comput. Sci., 2011)

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

The X-flex cross-platform scheduler: who's the fairest of them all? - Joel L. Wolf; Zubair Nabi; Viswanath Nagarajan; Robert Saccone; Rohit Wagle; Kirsten Hildrum; Edward Pring; Kanthi K. Sarpatwar (Middleware (Industry Track), 2014)

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

The Container Selection Problem. - Viswanath Nagarajan; Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai; Joel L. Wolf (APPROX-RANDOM, 2015)

Approximation Algorithms for Connected Maximum Cut and Related Problems. - Mohammad Taghi Hajiaghayi; Guy Kortsarz; Robert MacDavid; Manish Purohit; Kanthi K. Sarpatwar (ESA, 2015)

Allocation Algorithms for Networks with Scarce Resources. - Kanthi K. Sarpatwar (2015)

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

Generalized Assignment of Time-Sensitive Item Groups. - Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (APPROX-RANDOM, 2018)

Towards Enabling Trusted Artificial Intelligence via Blockchain. - Kanthi K. Sarpatwar; Roman Vaculín; Hong Min; Gong Su; Terry Heath; Giridhar Ganapavarapu; Donna Dillenberger (PADG@ESORICS, 2018)

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. - Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (SPAA, 2018)

On maximum leaf trees and connections to connected maximum cut problems. - Rajiv Gandhi; Mohammad Taghi Hajiaghayi; Guy Kortsarz; Manish Purohit; Kanthi K. Sarpatwar (Inf. Process. Lett., 2018)

Online Resource Allocation with Matching Constraints. - John P. Dickerson; Karthik Abinav Sankararaman; Kanthi Kiran Sarpatwar; Aravind Srinivasan; Kun-Lung Wu; Pan Xu 001 (AAMAS, 2019)

Blockchain Enabled AI Marketplace: The Price You Pay for Trust. - Kanthi K. Sarpatwar; Venkata Sitaramagiridharganesh Ganapavarapu; Karthikeyan Shanmugam 001; Akond Rahman; Roman Vaculín (CVPR Workshops, 2019)

Generalized Assignment via Submodular Optimization with Reserved Capacity. - Ariel Kulik; Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (ESA, 2019)

The Preemptive Resource Allocation Problem. - Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (FSTTCS, 2019)

Differentially Private Distributed Data Summarization under Covariate Shift. - Kanthi K. Sarpatwar; Karthikeyan Shanmugam 001; Venkata Sitaramagiridharganesh Ganapavarapu; Ashish Jagmohan; Roman Vaculín (NeurIPS, 2019)

Blockchain analytics and artificial intelligence. - Donna Dillenberger; Petr Novotný 002; Q. Zhang; Praveen Jayachandran; H. Gupta; Sandeep Hans; Dinesh C. Verma; Shreya Chakraborty; J. J. Thomas; M. M. Walli; Roman Vaculín; Kanthi K. Sarpatwar (IBM J. Res. Dev., 2019)

Constrained submodular maximization via greedy local search. - Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (Oper. Res. Lett., 2019)

Maximizing Throughput in Flow Shop Real-Time Scheduling. - Lior Ben Yamin; Jing Li 025; Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (APPROX-RANDOM, 2020)

Privacy Enhanced Decision Tree Inference. - Kanthi K. Sarpatwar; Nalini K. Ratha; Karthik Nandakumar; Karthikeyan Shanmugam 001; James T. Rayfield; Sharath Pankanti; Roman Vaculín (CVPR Workshops, 2020)

Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. - Samir Khuller; Manish Purohit; Kanthi K. Sarpatwar (SIAM J. Discret. Math., 2020)

Efficient Encrypted Inference on Ensembles of Decision Trees. - Kanthi K. Sarpatwar; Karthik Nandakumar; Nalini K. Ratha; James T. Rayfield; Karthikeyan Shanmugam 001; Sharath Pankanti; Roman Vaculín (CoRR, 2021)

Physics-based multiple time-series univariate forecasting. - Sumanta Mukherjee; Arindam Jati; Kanthi K. Sarpatwar; Roman Vaculín (IEEE Big Data, 2022)

HE-PEx: Efficient Machine Learning under Homomorphic Encryption using Pruning, Permutation and Expansion. - Ehud Aharoni; Moran Baruch; Pradip Bose; Alper Buyuktosunoglu; Nir Drucker; Subhankar Pal; Tomer Pelleg; Kanthi K. Sarpatwar; Hayim Shaul; Omri Soceanu; Roman Vaculín (CoRR, 2022)

Efficient Pruning for Machine Learning Under Homomorphic Encryption. - Ehud Aharoni; Moran Baruch; Pradip Bose; Alper Buyuktosunoglu; Nir Drucker; Subhankar Pal; Tomer Pelleg; Kanthi K. Sarpatwar; Hayim Shaul; Omri Soceanu; Roman Vaculín (ESORICS (4), 2023)

AI Explainability 360 Toolkit for Time-Series and Industrial Use Cases. - Giridhar Ganapavarapu; Sumanta Mukherjee; Natalia Martinez Gil; Kanthi K. Sarpatwar; Amaresh Rajasekharan; Amit Dhurandhar; Vijay Arya; Roman Vaculín (KDD, 2023)

TsSHAP: Robust model agnostic feature-based explainability for time series forecasting. - Vikas C. Raykar; Arindam Jati; Sumanta Mukherjee; Nupur Aggarwal; Kanthi K. Sarpatwar; Giridhar Ganapavarapu; Roman Vaculín (CoRR, 2023)