Kishen N. Gowda

Orcid: 0000-0001-6573-9445

According to our database1, Kishen N. Gowda authored at least 14 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Improved Parallel Algorithms for EF1 Allocations.
CoRR, May, 2026

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation.
CoRR, February, 2026

Chamfer-Linkage for Hierarchical Agglomerative Clustering.
CoRR, February, 2026

UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees.
Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2026

2025
Parallel Hierarchical Agglomerative Clustering in Low Dimensions.
CoRR, July, 2025

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering.
Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

2024
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Efficient Centroid-Linkage Clustering.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

It's Hard to HAC Average Linkage!
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Improved Bi-point Rounding Algorithms and a Golden Barrier for <i>k</i>-Median.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Socially Fair Center-Based and Linear Subspace Clustering.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

2022
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median.
CoRR, 2022

2020
A Parameterized Perspective on Attacking and Defending Elections.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Improved FPT Algorithms for Deletion to Forest-Like Structures.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020


  Loading...