A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs. - Mohammed Gharib; Ehsan Emamjomeh-Zadeh; Ashkan Norouzi-Fard; Ali Movaghar 001 (AINA Workshops, 2013)

The Minimum Vulnerability Problem. - Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Ashkan Norouzi-Fard; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (Algorithmica, 2014)

Towards Tight Lower Bounds for Scheduling Problems. - Abbas Bazzi; Ashkan Norouzi-Fard (ESA, 2015)

An Efficient Streaming Algorithm for the Submodular Cover Problem. - Ashkan Norouzi-Fard; Abbas Bazzi; Ilija Bogunovic; Marwa El Halabi; Ya-Ping Hsieh; Volkan Cevher (NIPS, 2016)

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. - Slobodan Mitrovic; Ilija Bogunovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Volkan Cevher (NIPS, 2017)

Dynamic Facility Location via Exponential Clocks. - Hyung-Chan An; Ashkan Norouzi-Fard; Ola Svensson (ACM Trans. Algorithms, 2017)

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. - Ashkan Norouzi-Fard; Jakub Tarnawski; Slobodan Mitrovic; Amir Zandieh; Aidasadat Mousavifar; Ola Svensson (ICML, 2018)

Algorithms For Clustering Problems - Theoretical Guarantees and Empirical Evaluations. - Ashkan Norouzi-Fard (2018)

Fast and Accurate $k$-means++ via Rejection Sampling. - Vincent Cohen-Addad; Silvio Lattanzi; Ashkan Norouzi-Fard; Christian Sohler; Ola Svensson (NeurIPS, 2020)

Fairness in Streaming Submodular Maximization: Algorithms and Hardness. - Marwa El Halabi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakab Tardos; Jakub Tarnawski (NeurIPS, 2020)

Fully Dynamic Algorithm for Constrained Submodular Optimization. - Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Morteza Zadimoghaddam (NeurIPS, 2020)

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. - Michael Kapralov; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakab Tardos (SODA, 2020)

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. - Sara Ahmadian; Ashkan Norouzi-Fard; Ola Svensson; Justin Ward (SIAM J. Comput., 2020)

Correlation Clustering in Constant Many Parallel Rounds. - Vincent Cohen-Addad; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (ICML, 2021)

Fairness and Bias in Online Selection. - José Correa 001; Andrés Cristi; Paul Duetting; Ashkan Norouzi-Fard (ICML, 2021)

Parallel and Efficient Hierarchical k-Median Clustering. - Vincent Cohen-Addad; Silvio Lattanzi; Ashkan Norouzi-Fard; Christian Sohler; Ola Svensson (NeurIPS, 2021)

Streaming Belief Propagation for Community Detection. - Yuchen Wu 002; Jakab Tardos; MohammadHossein Bateni; André Linhares; Filipe Miguel Gonçalves de Almeida; Andrea Montanari; Ashkan Norouzi-Fard (NeurIPS, 2021)

Consistent k-Clustering for General Metrics. - Hendrik Fichtenberger; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (SODA, 2021)

Streaming Submodular Maximization with Matroid and Matching Constraints. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (CoRR, 2021)

Approximate Cluster Recovery from Noisy Labels. - Buddhima Gamlath; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (COLT, 2022)

Submodular Maximization Subject to Matroid Intersection on the Fly. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ESA, 2022)

Streaming Submodular Maximization Under Matroid Constraints. - Moran Feldman; Paul Liu 001; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ICALP, 2022)

Deletion Robust Submodular Maximization over Matroids. - Paul Duetting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Morteza Zadimoghaddam (ICML, 2022)

Near-Optimal Correlation Clustering with Privacy. - Vincent Cohen-Addad; Chenglin Fan; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (NeurIPS, 2022)

Deletion Robust Non-Monotone Submodular Maximization over Matroids. - Paul Dütting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Morteza Zadimoghaddam (CoRR, 2022)

Fairness in Streaming Submodular Maximization over a Matroid Constraint. - Marwa El Halabi; Federico Fusco; Ashkan Norouzi-Fard; Jakab Tardos; Jakub Tarnawski (ICML, 2023)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (J. ACM, 2023)

Fairness in Submodular Maximization over a Matroid Constraint. - Marwa El Halabi; Jakub Tarnawski; Ashkan Norouzi-Fard; Thuy-Duong Vuong (AISTATS, 2024)

Consistent Submodular Maximization. - Paul Duetting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Morteza Zadimoghaddam (ICML, 2024)

Resilient k-Clustering. - Sara Ahmadian; MohammadHossein Bateni; Hossein Esfandiari; Silvio Lattanzi; Morteza Monemizadeh; Ashkan Norouzi-Fard (KDD, 2024)

The Cost of Consistency: Submodular Maximization with Constant Recourse. - Paul Dütting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson; Morteza Zadimoghaddam (STOC, 2025)

Fully Dynamic Submodular Maximization over Matroids. - Paul Dütting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Morteza Zadimoghaddam (ACM Trans. Algorithms, 2025)

Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality. - Filipe Miguel Gonçalves de Almeida; CJ Carey; Hendrik Fichtenberger; Jonathan Halcrow; Silvio Lattanzi; André Linhares; Tao Meng; Ashkan Norouzi-Fard; Nikos Parotsidis; Bryan Perozzi; David Simcha (CoRR, 2025)