default search action
Sara Ahmadian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Sara Ahmadian, Edith Cohen:
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. ICML 2024 - [c23]Sara Ahmadian
, MohammadHossein Bateni
Resilient k-Clustering. KDD 2024: 29-38 - [c22]Sara Ahmadian
Extracting Small Subgraphs in Road Networks. WWW 2024: 493-502 - [c21]Sara Ahmadian
Efficient Location Sampling Algorithms for Road Networks. WWW (Companion Volume) 2024: 899-902 - [i17]Sruthi Gorantla, Sara Ahmadian:
Fair Active Ranking from Pairwise Preferences. CoRR abs/2402.03252 (2024) - [i16]Sara Ahmadian, Edith Cohen:
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. CoRR abs/2405.17780 (2024) - [i15]Matthew Fahrbach, Srikumar Ramalingam, Morteza Zadimoghaddam, Sara Ahmadian, Gui Citovsky, Giulia DeSalvo:
GIST: Greedy Independent Set Thresholding for Diverse Data Summarization. CoRR abs/2405.18754 (2024) - [i14]Simon Yu, Liangyu Chen, Sara Ahmadian, Marzieh Fadaee:
Diversify and Conquer: Diversity-Centric Data Selection with Iterative Refinement. CoRR abs/2409.11378 (2024) - 2023
- [j4]Sara Ahmadian, Hossein Esfandiari, Vahab Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. J. Mach. Learn. Res. 24: 44:1-44:46 (2023) - [c20]Sara Ahmadian, Maryam Negahbani:
Improved Approximation for Fair Correlation Clustering. AISTATS 2023: 9499-9516 - [c19]Sandeep Silwal, Sara Ahmadian, Andrew Nystrom, Andrew McCallum, Deepak Ramachandran, Seyed Mehran Kazemi:
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals. ICLR 2023 - [c18]Sandeep Silwal, Sara Ahmadian, Andrew Nystrom, Andrew McCallum, Deepak Ramachandran, Seyed Mehran Kazemi:
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals. SustaiNLP 2023: 1-31 - [c17]Suman K. Bera
DeMEtRIS: Counting (near)-Cliques by Crawling. WSDM 2023: 312-320 - 2022
- [c16]Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. SODA 2022: 20-34 - [i13]Sara Ahmadian, Maryam Negahbani:
Improved Approximation for Fair Correlation Clustering. CoRR abs/2206.05050 (2022) - [i12]Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian:
DeMEtRIS: Counting (near)-Cliques by Crawling. CoRR abs/2212.03957 (2022) - 2021
- [c15]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. AISTATS 2021: 1657-1665 - [c14]Sara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam:
Distributed Load Balancing: A New Framework and Improved Guarantees. ITCS 2021: 79:1-79:20 - [i11]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. CoRR abs/2102.11548 (2021) - 2020
- [j3]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. SIAM J. Comput. 49(4) (2020) - [c13]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c12]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Fair Correlation Clustering. AISTATS 2020: 4195-4205 - [c11]Sara Ahmadian, Shahrzad Haddadan:
A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications. IEEE BigData 2020: 5-14 - [c10]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. NeurIPS 2020 - [i10]Sara Ahmadian, Alessandro Epasto
Fair Correlation Clustering. CoRR abs/2002.02274 (2020) - [i9]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. CoRR abs/2006.10221 (2020) - [i8]Sara Ahmadian, Shahrzad Haddadan:
The Wedge Picking Model: A dynamic graph model based on triadic closure. CoRR abs/2012.01691 (2020)
2010 – 2019
- 2019
- [c9]Sara Ahmadian, Alessandro Epasto
Clustering without Over-Representation. KDD 2019: 267-275 - [i7]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Clustering without Over-Representation. CoRR abs/1905.12753 (2019) - [i6]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - 2018
- [j2]Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
Stabilizing network bargaining games by blocking players. Math. Program. 172(1-2): 249-275 (2018) - [j1]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - [c8]Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - 2017
- [b1]Sara Ahmadian:
Approximation Algorithms for Clustering and Facility Location Problems. University of Waterloo, Ontario, Canada, 2017 - [c7]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS 2017: 61-72 - [c6]Sara Ahmadian, Zachary Friggstad:
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. ICALP 2017: 55:1-55:13 - [i5]Sara Ahmadian, Zachary Friggstad:
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. CoRR abs/1705.10396 (2017) - 2016
- [c5]Sara Ahmadian, Chaitanya Swamy:
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. ICALP 2016: 69:1-69:15 - [c4]Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità:
Stabilizing Network Bargaining Games by Blocking Players. IPCO 2016: 164-177 - [i4]Sara Ahmadian, Chaitanya Swamy:
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. CoRR abs/1608.01700 (2016) - [i3]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR abs/1612.07925 (2016) - 2014
- [c3]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM 2014: 17-33 - 2013
- [c2]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA 2013: 1607-1621 - [i2]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. CoRR abs/1301.4478 (2013) - 2012
- [c1]Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. WAOA 2012: 257-271 - 2011
- [i1]Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. CoRR abs/1104.3128 (2011)
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 2024-10-15 20:45 CEST 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: