Ameet Gadekar

Orcid: 0009-0004-8040-9881

According to our database1, Ameet Gadekar authored at least 17 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms.
CoRR, May, 2025

Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means.
CoRR, April, 2025

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights.
Proceedings of the ACM on Web Conference 2025, 2025

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering.
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024
On the Parameterized Complexity of Compact Set Packing.
Algorithmica, November, 2024

FPT approximations for Capacitated Sum of Radii and Diameters.
CoRR, 2024

Diversity-aware clustering: Computational Complexity and Approximation Algorithms.
CoRR, 2024

Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Parameterized Approximation Results for Clustering and Graph Packing Problems.
PhD thesis, 2023

Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021
Approximation algorithms for k-median with lower-bound constraints.
CoRR, 2021

2020
Improved learning of <i>k</i>-parities.
Theor. Comput. Sci., 2020

2018
Improved Learning of k-Parities.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2015
On the hardness of learning sparse parities.
Electron. Colloquium Comput. Complex., 2015

On learning k-parities with and without noise.
CoRR, 2015


  Loading...