| Streaming algorithms for line simplification MA Abam, M de Berg, P Hachenberger, A Zarei Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 70 | 2007 |
| Visibility testing and counting S Alipour, A Zarei Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2011 | 57 | 2011 |
| Efficient computation of query point visibility in polygons with holes A Zarei, M Ghodsi Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 42 | 2005 |
| Touring a sequence of disjoint polygons: Complexity and extension A Ahadi, A Mozafari, A Zarei Theoretical Computer Science 556, 45-54, 2014 | 25 | 2014 |
| Query point visibility computation in polygons with holes A Zarei, M Ghodsi Computational Geometry 39 (2), 78-90, 2008 | 25 | 2008 |
| A simple, faster method for kinetic proximity problems Z Rahmati, MA Abam, V King, S Whitesides, A Zarei Computational Geometry 48 (4), 342-359, 2015 | 17 | 2015 |
| Kinetic Euclidean minimum spanning tree in the plane Z Rahmati, A Zarei Journal of Discrete Algorithms 16, 2-11, 2012 | 16 | 2012 |
| Computing polygonal path simplification under area measures S Daneshpajouh, M Ghodsi, A Zarei Graphical models 74 (5), 283-289, 2012 | 10 | 2012 |
| Kinetic pie delaunay graph and its applications MA Abam, Z Rahmati, A Zarei Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 9 | 2012 |
| Weak visibility of two objects in planar polygonal scenes M Nouri, A Zarei, M Ghodsi Computational Science and Its Applications–ICCSA 2007: International …, 2007 | 9 | 2007 |
| Touring disjoint polygons problem is NP-hard A Ahadi, A Mozafari, A Zarei International Conference on Combinatorial Optimization and Applications, 351-360, 2013 | 8 | 2013 |
| Recognizing visibility graphs of triangulated irregular networks H Boomari, M Ostovari, A Zarei Fundamenta Informaticae 179 (4), 345-360, 2021 | 5 | 2021 |
| Visibility testing and counting S Alipour, M Ghodsi, A Zarei, M Pourreza Information Processing Letters 115 (9), 649-654, 2015 | 5 | 2015 |
| A practical approach for planar visibility maintenance A Zarei, M Ghodsi Journal for Geometry and Graphics 13 (1), 1-16, 2009 | 5 | 2009 |
| Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes A Zarei, AA Khosravi, M Ghodsi 11th CSI Computer Conference (CSICC’2006), IPM School of Computer Science …, 2006 | 4 | 2006 |
| Recognizing visibility graphs of polygons with holes and internal-external visibility graphs of polygons H Boomari, M Ostovari, A Zarei arXiv preprint arXiv:1804.05105, 2018 | 3 | 2018 |
| Connecting guards with minimum Steiner points inside simple polygons A Ahadi, A Zarei Theoretical Computer Science 775, 26-31, 2019 | 2 | 2019 |
| When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem A Mashreghi, A Zarei Theory of Computing Systems 58, 287-303, 2016 | 2 | 2016 |
| Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. Z Rahmati, A Zarei CCCG, 43-45, 2010 | 2 | 2010 |
| Visibility graphs of anchor polygons H Boomari, A Zarei Journal of Graph Algorithms and Applications 26 (1), 15-34, 2022 | 1 | 2022 |
Mohammad GhodsiProfessor of Computer Science, Sharif University of Technology在 sharif.edu 的电子邮件经过验证
