About me
I'm a third year 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.
In Review
Parallel and Sequential Hardness of Hierarchical Graph Clustering
Under Submission at ICALP '24
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
Under Submission at SPAA '24
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
Socially Fair Center-based and Linear Subspace Clustering
Sruthi Gorantla, Kishen N Gowda, Amit Deshpande, Anand Louis
Proc. of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD), 2023
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median
Kishen N Gowda, Thomas Pensyl, Aravind Srinivasan, Khoa Trinh
Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
Improved FPT Algorithms for Deletion to Forest-like Structures
Kishen N Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Proc. of International Symposium On Algorithms And Computation (ISAAC), 2020
Get in Touch
- IRB 2104, 8125 Paint Branch Dr, College Park, MD, US
- kishen19 AT cs.umd.edu
~ from Hyperbole and a Half by Allie Brosh