Morteza Monemizadeh

60 papers A* 20A 6B 5Journal 24Unranked 4
YearRankTypeTitle / Venue / Authors
2025 A* conf
Dynamic Algorithms for Submodular Matching.
ICALP
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2025 J jnl
Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond.
CoRR
Kiarash Banihashem, Jeff Giliberti, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2025 J jnl
On the gravitation-based classification: A novel algorithm using equilibrium points for enhanced learning and dimensionality reduction.
Expert Syst. J. Knowl. Eng.
Mostafa Monemizadeh, Seyed Rouhollah Samareh Hashemi, Morteza Monemizadeh
2025 A* conf
Range Counting Oracles for Geometric Problems.
SoCG
Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff
2025 J jnl
Range Counting Oracles for Geometric Problems.
CoRR
Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff
2024 A* conf
A Dynamic Algorithm for Weighted Submodular Cover Problem.
ICML
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2024 J jnl
A Dynamic Algorithm for Weighted Submodular Cover Problem.
CoRR
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2024 A* conf
Dynamic Algorithms for Matroid Submodular Maximization.
SODA
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2024 A* conf
Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces.
NeurIPS
Leyla Biabani, Annika Hennes, Denise La Gordt Dillie, Morteza Monemizadeh, Melanie Schmidt
2024 A* conf
Resilient k-Clustering.
KDD
Sara Ahmadian, MohammadHossein Bateni, Hossein Esfandiari, Silvio Lattanzi, Morteza Monemizadeh, Ashkan Norouzi-Fard
2023 J jnl
Clique-Based Separators for Geometric Intersection Graphs.
Algorithmica
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2023 B conf
Clustering in Polygonal Domains.
ISAAC
Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous
2023 J jnl
Dynamic Algorithms for Matroid Submodular Maximization.
CoRR
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2023 A* conf
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time.
ICML
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2023 J jnl
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time.
CoRR
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2023 A* conf
Dynamic Non-monotone Submodular Maximization.
NeurIPS
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2023 J jnl
Dynamic Non-monotone Submodular Maximization.
CoRR
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2023 A conf
Facility Location in the Sublinear Geometric Model.
APPROX/RANDOM
Morteza Monemizadeh
2023 A* conf
Faster Query Times for Fully Dynamic k-Center Clustering with Outliers.
NeurIPS
Leyla Biabani, Annika Hennes, Morteza Monemizadeh, Melanie Schmidt
2023 A conf
k-Center Clustering with Outliers in the MPC and Streaming Model.
IPDPS
Mark de Berg, Leyla Biabani, Morteza Monemizadeh
2023 J jnl
k-Center Clustering with Outliers in the MPC and Streaming Model.
CoRR
Mark de Berg, Leyla Biabani, Morteza Monemizadeh
2022 — conf
Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs.
ICDM (Workshops)
MohammadHossein Bateni, Morteza Monemizadeh, Kees Voorintholt
2022 A conf
TSP in a Simple Polygon.
ESA
Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous
2021 B conf
Clique-Based Separators for Geometric Intersection Graphs.
ISAAC
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021 J jnl
Clique-Based Separators for Geometric Intersection Graphs.
CoRR
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021 B conf
Maximum-Weight Matching in Sliding Windows and Beyond.
ISAAC
Leyla Biabani, Mark de Berg, Morteza Monemizadeh
2021 A conf
k-Center Clustering with Outliers in the Sliding-Window Model.
ESA
Mark de Berg, Morteza Monemizadeh, Yu Zhong
2021 J jnl
k-Center Clustering with Outliers in the Sliding-Window Model.
CoRR
Mark de Berg, Morteza Monemizadeh, Yu Zhong
2020 A* conf
Dynamic Submodular Maximization.
NeurIPS
Morteza Monemizadeh
2019 J jnl
Dynamic Maximal Independent Set.
CoRR
Morteza Monemizadeh
2019 J jnl
Planar graphs: Random walks and bipartiteness testing.
Random Struct. Algorithms
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2019 J jnl
Structural Results on Matching Estimation with Applications to Streaming.
Algorithmica
Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou
2018 J jnl
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
ACM Trans. Algorithms
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak
2017 J jnl
Prophet Secretary.
SIAM J. Discret. Math.
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh
2017 A* conf
Streaming Algorithms for Measuring H-Impact.
PODS
Priya Govindan, Morteza Monemizadeh, S. Muthukrishnan
2017 A* conf
Testable Bounded Degree Graph Properties Are Random Order Streamable.
ICALP
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
2017 J jnl
Testable Bounded Degree Graph Properties Are Random Order Streamable.
CoRR
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
2017 A conf
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.
ESA
Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan
2016 A* conf
Clustering Problems on Sliding Windows.
SODA
Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh
2016 J jnl
Estimating Weighted Matchings in o(n) Space.
CoRR
Elena Grigorescu, Morteza Monemizadeh, Samson Zhou
2016 — conf
Finding Large Matchings in Semi-Streaming.
ICDM Workshops
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh
2016 A* conf
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.
SODA
Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova
2016 J jnl
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.
CoRR
Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan
2015 J jnl
A Unified Approach for Clustering Problems on Sliding Windows.
CoRR
Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh
2015 B conf
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
SPAA
Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh
2015 — conf
Clustering on Sliding Windows in Polylogarithmic Space.
FSTTCS
Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh
2015 J jnl
Kernelization via Sampling with Applications to Dynamic Graph Streams.
CoRR
Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova
2015 A* conf
Parameterized Streaming: Maximal Matching and Vertex Cover.
SODA
Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh
2015 A conf
Prophet Secretary.
ESA
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh
2015 J jnl
Prophet Secretary.
CoRR
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh
2015 A* conf
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
SODA
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak
2014 J jnl
Parameterized Streaming Algorithms for Vertex Cover.
CoRR
Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh
2014 J jnl
Planar Graphs: Random Walks and Bipartiteness Testing.
CoRR
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2013 A* conf
(1+ Є)-approximation for facility location in data streams.
SODA
Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler
2011 — —
Non-uniform Sampling in Clustering and Streaming.
Morteza Monemizadeh
2011 A* conf
Planar Graphs: Random Walks and Bipartiteness Testing.
FOCS
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2010 A* conf
1-Pass Relative-Error L
SODA
Morteza Monemizadeh, David P. Woodruff
2010 A* conf
Coresets and Sketches for High Dimensional Subspace Approximation Problems.
SODA
Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff
2007 — conf
A PTAS for k-means clustering based on weak coresets.
SCG
Dan Feldman, Morteza Monemizadeh, Christian Sohler
2005 B conf
A Hybrid Approach for Refreshing Web Page Repositories.
DASFAA
Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh