default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmeet Gadekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c8]Ameet Gadekar, Tanmay Inamdar:
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. STACS 2025: 35:1-35:20- [i12]Ameet Gadekar, Tanmay Inamdar:
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. CoRR abs/2501.03663 (2025) - 2024
- [j2]Ameet Gadekar:
On the Parameterized Complexity of Compact Set Packing. Algorithmica 86(11): 3579-3597 (2024) - [c7]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP 2024: 6:1-6:19 - [i11]Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Aristides Gionis:
Diversity-aware clustering: Computational Complexity and Approximation Algorithms. CoRR abs/2401.05502 (2024) - [i10]Arnold Filtser, Ameet Gadekar:
FPT approximations for Capacitated Sum of Radii and Diameters. CoRR abs/2409.04984 (2024) - [i9]Ameet Gadekar, Aristides Gionis, Suhas Thejaswi:
Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights. CoRR abs/2410.12913 (2024) - 2023
- [b1]Ameet Gadekar:
Parameterized Approximation Results for Clustering and Graph Packing Problems. Aalto University, Espoo, Finland, 2023 - [c6]Fateme Abbasi, Sandip Banerjee
, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS 2023: 1377-1399 - [c5]Ameet Gadekar:
On the Parameterized Complexity of Compact Set Packing. WALCOM 2023: 359-370 - [c4]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. WAOA 2023: 205-218 - [i8]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - [i7]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - [i6]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations. CoRR abs/2308.16033 (2023) - 2022
- [c3]Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Michal Osadnik:
Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics. KDD 2022: 1749-1759 - 2021
- [i5]Ameet Gadekar:
On the parameterized complexity of Compact Set Packing. CoRR abs/2111.06338 (2021) - [i4]Ameet Gadekar, Bruno Ordozgoiti, Suhas Thejaswi:
Approximation algorithms for k-median with lower-bound constraints. CoRR abs/2112.07030 (2021) - 2020
- [j1]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved learning of k-parities. Theor. Comput. Sci. 840: 249-256 (2020)
2010 – 2019
- 2018
- [c2]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved Learning of k-Parities. COCOON 2018: 542-553 - 2016
- [c1]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the Hardness of Learning Sparse Parities. ESA 2016: 11:1-11:17 - 2015
- [i3]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
On learning k-parities with and without noise. CoRR abs/1502.05375 (2015) - [i2]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. CoRR abs/1511.08270 (2015) - [i1]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. Electron. Colloquium Comput. Complex. TR15 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-24 22:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
