default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Monemizadeh
Person information
- affiliation: TU Eindhoven, Department of Mathematics and Computer Science, The Netherlands
- affiliation: Amazon, Palo Alto, CA, USA
- affiliation: Rutgers University, Department of Computer Science, Piscataway, NJ, USA
- affiliation: Charles University, Computer Science Institute, Prague, Czech Republic
- affiliation: Goethe University Frankfurt am Main, Institute for Computer Science, Germany
- affiliation: University of Maryland, Department of Computer Science, College Park, USA
- affiliation (PhD 2011): Dortmund University of Technology, Department of Computer Science, Germany
- affiliation: University of Paderborn, Heinz Nixdorf Institute, Paderborn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. ICML 2024- [c31]Sara Ahmadian
, MohammadHossein Bateni, Hossein Esfandiari, Silvio Lattanzi, Morteza Monemizadeh, Ashkan Norouzi-Fard:
Resilient k-Clustering. KDD 2024: 29-38 - [c30]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. SODA 2024: 3485-3533 - [i16]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. CoRR abs/2407.10003 (2024) - 2023
- [j5]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85(6): 1652-1678 (2023) - [c29]Morteza Monemizadeh:
Facility Location in the Sublinear Geometric Model. APPROX/RANDOM 2023: 6:1-6:24 - [c28]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. ICML 2023: 1660-1691 - [c27]Mark de Berg, Leyla Biabani, Morteza Monemizadeh:
k-Center Clustering with Outliers in the MPC and Streaming Model. IPDPS 2023: 853-863 - [c26]Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous:
Clustering in Polygonal Domains. ISAAC 2023: 23:1-23:15 - [c25]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. NeurIPS 2023 - [c24]Leyla Biabani, Annika Hennes, Morteza Monemizadeh, Melanie Schmidt:
Faster Query Times for Fully Dynamic k-Center Clustering with Outliers. NeurIPS 2023 - [i15]Mark de Berg, Leyla Biabani, Morteza Monemizadeh:
k-Center Clustering with Outliers in the MPC and Streaming Model. CoRR abs/2302.12811 (2023) - [i14]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. CoRR abs/2305.15192 (2023) - [i13]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. CoRR abs/2306.00959 (2023) - [i12]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. CoRR abs/2311.03685 (2023) - 2022
- [c23]Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous:
TSP in a Simple Polygon. ESA 2022: 5:1-5:14 - [c22]MohammadHossein Bateni, Morteza Monemizadeh, Kees Voorintholt:
Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs. ICDM (Workshops) 2022: 777-786 - 2021
- [c21]Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. ESA 2021: 13:1-13:13 - [c20]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. ISAAC 2021: 22:1-22:15 - [c19]Leyla Biabani, Mark de Berg, Morteza Monemizadeh:
Maximum-Weight Matching in Sliding Windows and Beyond. ISAAC 2021: 73:1-73:16 - [i11]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. CoRR abs/2109.09874 (2021) - [i10]Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. CoRR abs/2109.11853 (2021) - 2020
- [c18]Morteza Monemizadeh:
Dynamic Submodular Maximization. NeurIPS 2020
2010 – 2019
- 2019
- [j4]Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou:
Structural Results on Matching Estimation with Applications to Streaming. Algorithmica 81(1): 367-392 (2019) - [j3]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55(1): 104-124 (2019) - [i9]Morteza Monemizadeh:
Dynamic Maximal Independent Set. CoRR abs/1906.09595 (2019) - 2018
- [j2]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018) - 2017
- [j1]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. SIAM J. Discret. Math. 31(3): 1685-1701 (2017) - [c17]Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan:
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. ESA 2017: 29:1-29:15 - [c16]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP 2017: 131:1-131:14 - [c15]Priya Govindan, Morteza Monemizadeh, S. Muthukrishnan:
Streaming Algorithms for Measuring H-Impact. PODS 2017: 337-346 - [i8]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR abs/1707.07334 (2017) - 2016
- [c14]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Finding Large Matchings in Semi-Streaming. ICDM Workshops 2016: 608-614 - [c13]Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - [c12]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering Problems on Sliding Windows. SODA 2016: 1374-1390 - [i7]Elena Grigorescu, Morteza Monemizadeh, Samson Zhou:
Estimating Weighted Matchings in o(n) Space. CoRR abs/1604.07467 (2016) - [i6]Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan:
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. CoRR abs/1608.03118 (2016) - 2015
- [c11]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. ESA 2015: 496-508 - [c10]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering on Sliding Windows in Polylogarithmic Space. FSTTCS 2015: 350-364 - [c9]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. SODA 2015: 1217-1233 - [c8]Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh:
Parameterized Streaming: Maximal Matching and Vertex Cover. SODA 2015: 1234-1251 - [c7]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. SPAA 2015: 56-58 - [i5]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
A Unified Approach for Clustering Problems on Sliding Windows. CoRR abs/1504.05553 (2015) - [i4]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Dynamic Graph Streams. CoRR abs/1505.01731 (2015) - [i3]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. CoRR abs/1507.01155 (2015) - 2014
- [i2]Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh:
Parameterized Streaming Algorithms for Vertex Cover. CoRR abs/1405.0093 (2014) - [i1]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. CoRR abs/1407.2109 (2014) - 2013
- [c6]Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler:
(1+ Є)-approximation for facility location in data streams. SODA 2013: 1710-1728 - 2011
- [b1]Morteza Monemizadeh:
Non-uniform Sampling in Clustering and Streaming. Dortmund University of Technology, 2011 - [c5]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432 - 2010
- [c4]Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff:
Coresets and Sketches for High Dimensional Subspace Approximation Problems. SODA 2010: 630-649 - [c3]Morteza Monemizadeh, David P. Woodruff:
1-Pass Relative-Error Lp-Sampling with Applications. SODA 2010: 1143-1160
2000 – 2009
- 2007
- [c2]Dan Feldman, Morteza Monemizadeh, Christian Sohler:
A PTAS for k-means clustering based on weak coresets. SCG 2007: 11-18 - 2005
- [c1]Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh:
A Hybrid Approach for Refreshing Web Page Repositories. DASFAA 2005: 588-593
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
