| Parameterized approximation schemes for clustering with general norm objectives F Abbasi, S Banerjee, J Byrka, P Chalermsook, A Gadekar, ... 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 10 | 2023 |
| Clustering with fair-center representation: Parameterized approximation algorithms and heuristics S Thejaswi, A Gadekar, B Ordozgoiti, M Osadnik Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and …, 2022 | 10 | 2022 |
| On the hardness of learning sparse parities A Bhattacharyya, A Gadekar, S Ghoshal, R Saket arXiv preprint arXiv:1511.08270, 2015 | 10 | 2015 |
| On learning k-parities with and without noise A Bhattacharyya, A Gadekar, N Rajgopal arXiv preprint arXiv:1502.05375, 2015 | 4 | 2015 |
| On the parameterized complexity of compact set packing A Gadekar Algorithmica, 1-19, 2024 | 3 | 2024 |
| Parameterized approximation for robust clustering in discrete geometric spaces F Abbasi, S Banerjee, J Byrka, P Chalermsook, A Gadekar, ... arXiv preprint arXiv:2305.07316, 2023 | 3 | 2023 |
| Independent Set in k-Claw-Free Graphs: Conditional-Boundedness and the Power of LP/SDP Relaxations P Chalermsook, A Gadekar, K Khodamoradi, J Spoerhase International Workshop on Approximation and Online Algorithms, 205-218, 2023 | 2 | 2023 |
| Approximation algorithms for -median with lower-bound constraints A Gadekar, B Ordozgoiti, S Thejaswi arXiv e-prints, arXiv: 2112.07030, 2021 | 1 | 2021 |
| Improved learning of k-parities A Bhattacharyya, A Gadekar, N Rajgopal Theoretical Computer Science 840, 249-256, 2020 | 1 | 2020 |
| Improved Learning of k-Parities A Bhattacharyya, A Gadekar, N Rajgopal International Computing and Combinatorics Conference, 542-553, 2018 | 1 | 2018 |
| Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights A Gadekar, A Gionis, S Thejaswi arXiv preprint arXiv:2410.12913, 2024 | | 2024 |
| FPT approximations for Capacitated Sum of Radii and Diameters A Filtser, A Gadekar arXiv preprint arXiv:2409.04984, 2024 | | 2024 |
| Diversity-aware clustering: Computational Complexity and Approximation Algorithms S Thejaswi, A Gadekar, B Ordozgoiti, A Gionis arXiv preprint arXiv:2401.05502, 2024 | | 2024 |
| Parameterized Approximation Results for Clustering and Graph Packing Problems A Gadekar Aalto University, 2023 | | 2023 |
| On the complexity of Compact Set r-Packing A Gadekar | | 2019 |
| On Learning k-Parities and the Complexity of k-Vector-SUM A Gadekar | | 2018 |
| 24th Annual European Symposium on Algorithms (ESA 2016) L Georgiadis, GF Italiano, N Parotsidis, O Svensson, M Abolhassani, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | | 2016 |
