Sara Ahmadian

Orcid: 0000-0002-7060-6775

According to our database1, Sara Ahmadian authored at least 23 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fair Active Ranking from Pairwise Preferences.
CoRR, 2024

2023
Robust Load Balancing with Machine Learned Advice.
J. Mach. Learn. Res., 2023

DeMEtRIS: Counting (near)-Cliques by Crawling.
Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals.
Proceedings of The Fourth Workshop on Simple and Efficient Natural Language Processing, 2023

Improved Approximation for Fair Correlation Clustering.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2021
Distributed Load Balancing: A New Framework and Improved Guarantees.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
SIAM J. Comput., 2020

The Wedge Picking Model: A dynamic graph model based on triadic closure.
CoRR, 2020

Fair Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Fair Correlation Clustering.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Clustering without Over-Representation.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018
Approximation Algorithms for Minimum-Load <i>k</i>-Facility Location.
ACM Trans. Algorithms, 2018

Stabilizing network bargaining games by blocking players.
Math. Program., 2018

Algorithms for Inverse Optimization Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Approximation Algorithms for Clustering and Facility Location Problems.
PhD thesis, 2017

Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Approximation Algorithms for Minimum-Load k-Facility Location.
Proceedings of the Approximation, 2014

2013
Local-Search based Approximation Algorithms for Mobile Facility Location Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Improved Approximation Guarantees for Lower-Bounded Facility Location.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012


  Loading...