About me
I'm a Ph.D. student in Computer Science at the University of Maryland, College Park, where I am fortunate to be advised by Laxman Dhulipala and Aravind Srinivasan. Prior to joining UMD, I completed my bachelors in Computer Science and Engineering at IIT Gandhinagar.
My research interests broadly lie in efficient parallel graph algorithms, approximation & parameterized algorithms for problems in combinatorial optimization. In particular, I have been looking into clustering problems, as well as algorithmic fairness and differential privacy.
Journal Articles
Improved FPT Algorithms for Deletion to Forest-like Structures
Kishen N Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Algorithmica, 2024
Journal Version: Link
Conference Proceedings
Efficient Centroid-Linkage Clustering
MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N Gowda, D Ellis Hershkowitz, Rajesh Jayaram, Jakub Łącki
NeurIPS, 2024
ArXiv: Link
It's Hard to HAC with Average Linkage!
MohammadHossein Bateni, Laxman Dhulipala, Kishen N Gowda, D Ellis Hershkowitz, Rajesh Jayaram, Jakub Łącki
ICALP, 2024
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
Laxman Dhulipala, Xiaojun Dong, Kishen N Gowda, Yan Gu
SPAA, 2024
Conference Version: Link ArXiv: Link    Code: Link
Socially Fair Center-based and Linear Subspace Clustering
Sruthi Gorantla, Kishen N Gowda, Amit Deshpande, Anand Louis
ECML-PKDD, 2023
Conference Version: Link ArXiv: Link    Code: Link
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median
Kishen N Gowda, Thomas Pensyl, Aravind Srinivasan, Khoa Trinh
SODA, 2023