A Hybrid Approach for Refreshing Web Page Repositories. - Mohammad Ghodsi; Oktie Hassanzadeh; Shahab Kamali; Morteza Monemizadeh (DASFAA, 2005)

A PTAS for k-means clustering based on weak coresets. - Dan Feldman; Morteza Monemizadeh; Christian Sohler (SCG, 2007)

Coresets and Sketches for High Dimensional Subspace Approximation Problems. - Dan Feldman; Morteza Monemizadeh; Christian Sohler; David P. Woodruff (SODA, 2010)

1-Pass Relative-Error Lp-Sampling with Applications. - Morteza Monemizadeh; David P. Woodruff (SODA, 2010)

Non-uniform Sampling in Clustering and Streaming. - Morteza Monemizadeh (2011)

(1+ Є)-approximation for facility location in data streams. - Artur Czumaj; Christiane Lammersen; Morteza Monemizadeh; Christian Sohler (SODA, 2013)

Parameterized Streaming Algorithms for Vertex Cover. - Rajesh Hemant Chitnis; Graham Cormode; Mohammad Taghi Hajiaghayi; Morteza Monemizadeh (CoRR, 2014)

Clustering on Sliding Windows in Polylogarithmic Space. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (FSTTCS, 2015)

Parameterized Streaming: Maximal Matching and Vertex Cover. - Rajesh Hemant Chitnis; Graham Cormode; Mohammad Taghi Hajiaghayi; Morteza Monemizadeh (SODA, 2015)

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. - Rajesh Hemant Chitnis; Graham Cormode; Hossein Esfandiari; MohammadTaghi Hajiaghayi; Morteza Monemizadeh (SPAA, 2015)

A Unified Approach for Clustering Problems on Sliding Windows. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (CoRR, 2015)

Kernelization via Sampling with Applications to Dynamic Graph Streams. - Rajesh Hemant Chitnis; Graham Cormode; Hossein Esfandiari; MohammadTaghi Hajiaghayi; Andrew McGregor 001; Morteza Monemizadeh; Sofya Vorotnikova (CoRR, 2015)

Finding Large Matchings in Semi-Streaming. - Hossein Esfandiari; MohammadTaghi Hajiaghayi; Morteza Monemizadeh (ICDM Workshops, 2016)

Clustering Problems on Sliding Windows. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (SODA, 2016)

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. - Rajesh Chitnis; Graham Cormode; Hossein Esfandiari; MohammadTaghi Hajiaghayi; Andrew McGregor 001; Morteza Monemizadeh; Sofya Vorotnikova (SODA, 2016)

Estimating Weighted Matchings in o(n) Space. - Elena Grigorescu; Morteza Monemizadeh; Samson Zhou (CoRR, 2016)

The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. - Graham Cormode; Hossein Jowhari; Morteza Monemizadeh; S. Muthukrishnan 001 (ESA, 2017)

Testable Bounded Degree Graph Properties Are Random Order Streamable. - Morteza Monemizadeh; S. Muthukrishnan 001; Pan Peng 001; Christian Sohler (ICALP, 2017)

Streaming Algorithms for Measuring H-Impact. - Priya Govindan; Morteza Monemizadeh; S. Muthukrishnan 001 (PODS, 2017)

Prophet Secretary. - Hossein Esfandiari; MohammadTaghi Hajiaghayi; Vahid Liaghat; Morteza Monemizadeh (SIAM J. Discret. Math., 2017)

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. - Hossein Esfandiari; MohammadTaghi Hajiaghayi; Vahid Liaghat; Morteza Monemizadeh; Krzysztof Onak (ACM Trans. Algorithms, 2018)

Structural Results on Matching Estimation with Applications to Streaming. - Marc Bury; Elena Grigorescu; Andrew McGregor 001; Morteza Monemizadeh; Chris Schwiegelshohn; Sofya Vorotnikova; Samson Zhou (Algorithmica, 2019)

Dynamic Maximal Independent Set. - Morteza Monemizadeh (CoRR, 2019)

Planar graphs: Random walks and bipartiteness testing. - Artur Czumaj; Morteza Monemizadeh; Krzysztof Onak; Christian Sohler (Random Struct. Algorithms, 2019)

Dynamic Submodular Maximization. - Morteza Monemizadeh (NeurIPS, 2020)

k-Center Clustering with Outliers in the Sliding-Window Model. - Mark de Berg; Morteza Monemizadeh; Yu Zhong (ESA, 2021)

Maximum-Weight Matching in Sliding Windows and Beyond. - Leyla Biabani; Mark de Berg; Morteza Monemizadeh (ISAAC, 2021)

TSP in a Simple Polygon. - Henk Alkema; Mark de Berg; Morteza Monemizadeh; Leonidas Theocharous (ESA, 2022)

Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs. - MohammadHossein Bateni; Morteza Monemizadeh; Kees Voorintholt (ICDM (Workshops), 2022)

Facility Location in the Sublinear Geometric Model. - Morteza Monemizadeh (APPROX/RANDOM, 2023)

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICML, 2023)

k-Center Clustering with Outliers in the MPC and Streaming Model. - Mark de Berg; Leyla Biabani; Morteza Monemizadeh (IPDPS, 2023)

Clustering in Polygonal Domains. - Mark de Berg; Leyla Biabani; Morteza Monemizadeh; Leonidas Theocharous (ISAAC, 2023)

Dynamic Non-monotone Submodular Maximization. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (NeurIPS, 2023)

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers. - Leyla Biabani; Annika Hennes; Morteza Monemizadeh; Melanie Schmidt 001 (NeurIPS, 2023)

Clique-Based Separators for Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Morteza Monemizadeh; Leonidas Theocharous (Algorithmica, 2023)

A Dynamic Algorithm for Weighted Submodular Cover Problem. - Kiarash Banihashem; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICML, 2024)

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

Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces. - Leyla Biabani; Annika Hennes; Denise La Gordt Dillie; Morteza Monemizadeh; Melanie Schmidt 001 (NeurIPS, 2024)

Dynamic Algorithms for Matroid Submodular Maximization. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (SODA, 2024)

Range Counting Oracles for Geometric Problems. - Anne Driemel; Morteza Monemizadeh; Eunjin Oh 001; Frank Staals; David P. Woodruff (SoCG, 2025)

Dynamic Algorithms for Submodular Matching. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICALP, 2025)

On the gravitation-based classification: A novel algorithm using equilibrium points for enhanced learning and dimensionality reduction. - Mostafa Monemizadeh; Seyed Rouhollah Samareh Hashemi; Morteza Monemizadeh (Expert Syst. J. Knowl. Eng., 2025)