I am an assistant professor in the Computer Science Institute of Charles University in Prague. My interests include algorithms for big data, sublinear-time algorithms, streaming and dynamic algorithms, computational geometry in low-and high-dimensional Euclidean spaces, and machine learning. Before coming to Charles University, I was three years as a Postdoctoral Fellow at Goethe University Frankfurt, one year in the Computer Science Department at the University of Maryland at College Park hosted by MohammadTaghi Hajiaghayi, and a few years at Technische Universität Dortmund as a PhD student, where I was advised by Christian Sohler.

**Publications:**

- Vladimir Braverman,
Harry Lang,
Keith Levin, and Morteza Monemizadeh

Clustering Problems on Sliding Windows

In Proceedings of the 21st Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2016 , to appear . - Rajesh Hemant Chitnis,
Graham Cormode,
Hossein Esfandiari,
Mohammad Taghi Hajiaghayi,
Andrew McGregor, Morteza Monemizadeh, and
Sofya Vorotnikova

Kernelization via Sampling with Applications to Dynamic Graph Streams

In Proceedings of the 21st Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2016 , to appear . - Vladimir Braverman,
Harry Lang,
Keith Levin, and Morteza Monemizadeh

Clustering on Sliding Windows in Polylogarithmic Space

In Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015 , to appear . - Hossein Esfandiari,
Mohammad Taghi Hajiaghayi,
Vahid Liaghat, Morteza Monemizadeh

Prophet Secretary

In Proceedings of the 23rd Annual European Symposium on Algorithms, ESA 2015 , pp: 496-508 . - Rajesh Hemant Chitnis,
Graham Cormode,
Hossein Esfandiari,
Mohammad Taghi Hajiaghayi, and Morteza Monemizadeh

New Streaming Algorithms for Parameterized Maximal Matching & Beyond (Short Paper)

In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 , pp: 56-58 . - Hossein Esfandiari,
Mohammad Taghi Hajiaghayi,
Vahid Liaghat, Morteza Monemizadeh, and
Krzysztof Onak

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

In Proceedings of the 20th Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2015 , pp: 1217-1233 . - Rajesh Hemant Chitnis,
Graham Cormode,
Mohammad Taghi Hajiaghayi, and Morteza Monemizadeh

Parameterized Streaming: Maximal Matching and Vertex Cover

In Proceedings of the 22nd Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2015 , pp: 1234-1251 . - Artur Czumaj,
Christiane Lammersen, Morteza Monemizadeh, and
Christian Sohler

(1 + ε)-Approximation for Facility Location in Data Streams

In Proceedings of the 24th Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2013 , pp: 1710–1728 . - Artur Czumaj, Morteza Monemizadeh,
Krzysztof Onak, and
Christian Sohler

Planar Graphs: Random Walks and Bipartiteness Testing

In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 , pp: 423-432 . - Morteza Monemizadeh

Non-uniform sampling in clustering and streaming

PhD Thesis, TU Dortmund, 2010 . - Dan Feldman, Morteza Monemizadeh,
Christian Sohler, and
David Woodruff

Coresets and Sketches for High Dimensional Subspace Approximation Problems

In Proceedings of the 20th Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2010 , pp: 630-649 . - Morteza Monemizadeh and David Woodruff

1-Pass Relative-Error Lp-Sampling with Applications

In Proceedings of the 20th Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2010, pp: 1143-1160 . - Dan Feldman, Morteza Monemizadeh, and
Christian Sohler

A PTAS for k-Means Clustering Based on Weak Coresets

In Proceedings of the 23rd Annual Symposium on Computational Geometry, SOCG 2007, pp: 11-18 .