Morteza Monemizadeh
Morteza Monemizadeh
Assistant Professor at Eindhoven University of Technology, the Netherlands
Verified email at tue.nl
Title
Cited by
Cited by
Year
A PTAS for k-means clustering based on weak coresets
D Feldman, M Monemizadeh, C Sohler
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
1882007
1-Pass Relative-Error Lp-Sampling with Applications
M Monemizadeh, DP Woodruff
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1142010
Streaming algorithms for estimating the matching size in planar graphs and beyond
H Esfandiari, M Hajiaghayi, V Liaghat, M Monemizadeh, K Onak
ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018
812018
Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ...
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
772016
Coresets and sketches for high dimensional subspace approximation problems
D Feldman, M Monemizadeh, C Sohler, DP Woodruff
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
712010
Prophet secretary
H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh
SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017
602017
Parameterized streaming: Maximal matching and vertex cover
R Chitnis, G Cormode, MT Hajiaghayi, M Monemizadeh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
602014
Clustering problems on sliding windows
V Braverman, H Lang, K Levin, M Monemizadeh
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
312016
The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs
G Cormode, H Jowhari, M Monemizadeh, S Muthukrishnan
arXiv preprint arXiv:1608.03118, 2016
292016
Kernelization via sampling with applications to dynamic graph streams
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ...
arXiv preprint arXiv:1505.01731, 2015
232015
Planar graphs: Random walks and bipartiteness testing
A Czumaj, M Monemizadeh, K Onak, C Sohler
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 423-432, 2011
222011
The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors
M Monemizadeh, H Sarbazi-Azad
Proceedings of the 2005 ACM symposium on Applied computing, 729-733, 2005
192005
Streaming weighted matchings: Optimal meets greedy
E Grigorescu, M Monemizadeh, S Zhou
arXiv preprint arXiv:1608.01487, 2016
152016
Finding large matchings in semi-streaming
H Esfandiari, MT Hajiaghayi, M Monemizadeh
2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW …, 2016
142016
New Streaming Algorithms for Parameterized Maximal Matching & Beyond
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, M Monemizadeh
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
122015
Structural results on matching estimation with applications to streaming
M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81 (1), 367-392, 2019
112019
Testable bounded degree graph properties are random order streamable
M Monemizadeh, S Muthukrishnan, P Peng, C Sohler
arXiv preprint arXiv:1707.07334, 2017
92017
Clustering on sliding windows in polylogarithmic space
V Braverman, H Lang, K Levin, M Monemizadeh
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
92015
Planar graphs: Random walks and bipartiteness testing
A Czumaj, M Monemizadeh, K Onak, C Sohler
Random Structures & Algorithms 55 (1), 104-124, 2019
62019
Estimating Weighted Matchings in Space
E Grigorescu, M Monemizadeh, S Zhou
arXiv preprint arXiv:1604.07467, 2016
62016
The system can't perform the operation now. Try again later.
Articles 1–20