Surya Teja Gavva

According to our database, Surya Teja Gavva authored at least 7 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation.

Surya Teja Gavva, Peng Zhang

CoRR, September, 2025

On Approximability of Steiner Tree in ℓ_p-metrics.

Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S.

TheoretiCS, 2025

2024

Fairness of linear regression in decision making.

Vincent Cohen-Addad, Surya Teja Gavva, Karthik C. S., Claire Mathieu, Namrata

Int. J. Data Sci. Anal., September, 2024

Clustering categorical data: Soft rounding <i>k</i>-modes.

Surya Teja Gavva, Karthik C. S., Sharath Punna

Inf. Comput., January, 2024

On Approximability of Steiner Tree in <i>ℓ_p</i>-metrics.

Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S.

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Impossibility of Depth Reduction in Explainable Clustering.

Chengyuan Deng, Surya Teja Gavva, Karthik C. S., Parth Patel, Adarsh Srinivasan

CoRR, 2023

2022

Clustering Categorical Data: Soft Rounding k-modes.

Surya Teja Gavva, Karthik C. S., Sharath Punna

CoRR, 2022