مرتضی منعمی زاده

 Morteza Monemizadeh

Affiliations:

•  TU Eindhoven, Department of Mathematics and Computer Science, The Netherlands (2020 - )

Assistant Professor 

• Amazon, Palo Alto, CA, USA and WalmartLabs, Sunnyvale, CA, USA (2017-2020)

Senior Research Scientist

• Rutgers University, Department of Computer Science, Piscataway, NJ, USA (2016)

Visiting Assistant Professor

• Charles University, Computer Science Institute, Prague, Czech Republic (2015-2016)

Assistant Professor

• University of Maryland, Department of Computer Science, College Park, USA (2014)

Postdoc

• Goethe University Frankfurt am Main, Institute for Computer Science, Germany (2011-2013)

Postdoc

• Dortmund University of Technology, Department of Computer Science, Germany (2006-2010)

PhD 

Research Interests:

• Massive data models and algorithms (Streaming, Sublinear, Dynamic, and Massively Parallel Computation)

• Machine learning (Video Summarization, Clustering, Submodular Maximization, Anomaly Detection and NLP)

• Graph Theory and Combinatorics

Publication:

• Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Dynamic Algorithms for Matroid Submodular Maximization. SODA 2024 (to appear)

• Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Dynamic Non-monotone Submodular Maximization. NeurIPS 2023 (to appear)

• Leyla Biabani, Annika Hennes, Morteza Monemizadeh, Melanie Schmidt, Faster Query Times for Fully Dynamic  Center Clustering with Outliers. NeurIPS 2023 (to appear)

• Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous: Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85(6): 1652-1678 (2023)

• Morteza Monemizadeh: Facility Location in the Sublinear Geometric Model. APPROX/RANDOM 2023: 6:1-6:24

• Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh: Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. ICML 2023: 1660-1691

• Mark de Berg, Leyla Biabani, Morteza Monemizadeh: k-Center Clustering with Outliers in the MPC and Streaming Model. IPDPS 2023: 853-863

• Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous: Clustering in Polygonal Domains. ISAAC 2023: 23:1-23:15 (This work has been invited to Journal of Computational Geometry: Theory and Applications (CGTA) special issue on ISAAC 23.)

• Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous: TSP in a Simple Polygon. ESA 2022: 5:1-5:14. 

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

• Mark de Berg, Morteza Monemizadeh, Yu Zhong: k-Center Clustering with Outliers in the Sliding-Window Model. ESA 2021: 13:1-13:13

• Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous: Clique-Based Separators for Geometric Intersection Graphs. ISAAC 2021: 22:1-22:15

• Leyla Biabani, Mark de Berg, Morteza Monemizadeh: Maximum-Weight Matching in Sliding Windows and Beyond. ISAAC 2021: 73:1-73:16

• Morteza Monemizadeh: Dynamic Submodular Maximization. NeurIPS 2020

• 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)

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

• 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)

• Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh: Prophet Secretary. SIAM J. Discret. Math. 31(3): 1685-1701 (2017)

• 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

• Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler: Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP 2017: 131:1-131:14

• Priya Govindan, Morteza Monemizadeh, S. Muthukrishnan: Streaming Algorithms for Measuring H-Impact. PODS 2017: 337-346

• Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh: Finding Large Matchings in Semi-Streaming. ICDM Workshops 2016: 608-614

• 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

• Vladimir Braverman, Harry Lang, Keith Levin, Morteza Monemizadeh: Clustering Problems on Sliding Windows. SODA 2016: 1374-1390

• Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh: Prophet Secretary. ESA 2015: 496-508

• Vladimir Braverman, Harry Lang, Keith Levin, Morteza Monemizadeh: Clustering on Sliding Windows in Polylogarithmic Space. FSTTCS 2015: 350-364

• 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

• Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh: Parameterized Streaming: Maximal Matching and Vertex Cover. SODA 2015: 1234-1251

• 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

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

• Morteza Monemizadeh: Non-uniform Sampling in Clustering and Streaming. Dortmund University of Technology, 2011

• Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler: Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432

• Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff: Coresets and Sketches for High Dimensional Subspace Approximation Problems. SODA 2010: 630-649

• Morteza Monemizadeh, David P. Woodruff: 1-Pass Relative-Error Lp-Sampling with Applications. SODA 2010: 1143-1160

• Dan Feldman, Morteza Monemizadeh, Christian Sohler: A PTAS for k-means clustering based on weak coresets. SCG 2007: 11-18

• Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh: A Hybrid Approach for Refreshing Web Page Repositories. DASFAA 2005: 588-593