Ashkan Norouzi-Fard - Citegraph

Author Info

Name	Affiliation	Papers
ASHKAN NOROUZI-FARD	School of Computer and Communication Sciences, EPFL	17
Collaborators	Citations	PageRank
30	5	5.84
Referers	Referees	References
19	121	63

Search Limit

100121

Publications (17 rows)

Collaborators (30 rows)

Referers (19 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Deletion Robust Submodular Maximization over Matroids.	0	0.34	2022
Streaming Submodular Maximization Under Matroid Constraints	0	0.34	2022
Submodular Maximization Subject to Matroid Intersection on the Fly	0	0.34	2022
Consistent k-Clustering for General Metrics	0	0.34	2021
Fairness And Bias In Online Selection	0	0.34	2021
Parallel and Efficient Hierarchical k-Median Clustering.	0	0.34	2021
Correlation Clustering In Constantly Many Parallel Rounds	0	0.34	2021
Fast and Accurate $k$-means++ via Rejection Sampling	0	0.34	2020
Fully Dynamic Algorithm for Constrained Submodular Optimization	0	0.34	2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness	0	0.34	2020
The one-way communication complexity of submodular maximization with applications to streaming and robustness	1	0.35	2020
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples.	0	0.34	2020
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.	0	0.34	2018
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach	0	0.34	2017
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms	4	0.41	2017
An Efficient Streaming Algorithm for the Submodular Cover Problem.	0	0.34	2016
Dynamic facility location via exponential clocks	0	0.34	2014

1