2 citations · 4 across the 6 of their papers we have counts for
6 papers
Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
Surya Teja Gavva, Peng Zhang
The Marcus-Spielman-Srivastava theorem (Annals of Mathematics, 2015) for the Kadison-Singer conjecture implies the following result in spectral graph theory: For any undirected gra…
Dynamics of Vortex Clusters on a Torus
Aswathy K R, Udaya Maurya, Surya Teja Gavva +1
We investigate the collective dynamics of multivortex assemblies in a two dimensional (2D) toroidal fluid film of distinct curvature and topology. The incompressible and inviscid n…
Vortex Dynamics in Tubular Fluid Membranes
Udaya Maurya, Surya Teja Gavva, Arpan Saha +1
Thin cylindrical membranes arise in a wide variety of biological systems ranging from tubular structures on and within cell membranes to in-vitro experiments on artificial vesicles…
On Approximability of Steiner Tree in -metrics
Henry Fleischmann, Surya Teja Gavva, Karthik C. S
In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree connecting them. Addition…
Impossibility of Depth Reduction in Explainable Clustering
Chengyuan Deng, Surya Teja Gavva, Karthik C. S. +2
Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable -means and -median clustering pro…
Clustering Categorical Data: Soft Rounding k-modes
Surya Teja Gavva, Karthik C. S., Sharath Punna
Over the last three decades, researchers have intensively explored various clustering tools for categorical data analysis. Despite the proposal of various clustering algorithms, th…