Alireza Zarei Assistant Professor Department of Mathematical Sciences Sharif University of Technology

[ Current Activities ] [ Educational Background ] [ Research Interests ] [ Publications ] [ Students ] [ Teaching Experiences ] [ Familiarity with Computer Environments ] [ Professional Experiences ] [ Links ]
Current Activities
 I've started as an assistant professor in Sharif University of Technology from Aug 2009.
 My main research area is computational geometry.
 I am currently ICTC manager of the university.
Educational Background
 PhD in Computer Engineering, Sharif University of Technology, Tehran, Iran [20032008]
 M.S. in Computer Engineering, Sharif University of Technology, Tehran, Iran [20002002]
 B.S. in Computer Engineering, Sharif University of Technology, Tehran, Iran [19962000]
 Diploma in Math. and Physics, Bagher AlOloum High School, Ilam, Iran [19921996]
Research Interests
 Computational Geometry
 Computational Complexity
 NPCompleteness
 Approximation Algorithms
 Randomized Algorithms
 Graph Theory
Publications
Journals
 M. Ostovari, A. Zarei, A Better LP Rounding for Feedback Arc Set on Tournaments, Theoretical Computer Science , to appear, .
 S. Sheidani, A. Zarei, Privacypreserving twoparty computation of line segment intersection, International Journal of Information Security , to appear, .
 S. Mehrpour, A. Zarei, PseudoTriangle Visibility Graph: Characterization and Reconstruction, Scientia Iranica , to appear, .
 P. Zare, A. Azar, A. Zarei, Intelligence mechanisms for public sector supervision In designing the decisionmaking system of the Supreme Audit Court, (in Persian), Biannual Journal of Scientific Governmental Accounting (9:2), 2023, pp. 295314.
 P. Zare, A. Azar, A. Zarei, Designing a DecisionMaking System in the Field of Public Sector Supervision with Electronically Approach in the Supreme Audit Court, (in Persian), Biannual Journal of Scientific Governmental Accounting (7:2), 2021, pp. 4358.
 H. Boomari, A. Zarei, Visibility Graphs of Anchor Polygons, Journal of Graph Algorithms and Applications (26:1), 2021, pp. 1534.
 A. Zarei, H. Mehrabiun, A Graph Theoretic Approach for Employee Performance Appraisal, (in Persian), Modern Research in Decision Making (6:4), December 2021, pp. 131157.
 H. Boomari, M. Ostovari, A. Zarei, Recognizing Visibility Graphs of Triangulated Irregular Networks, Fundamenta Informaticae (179), May 2021, pp. 345360.
 A. Ahadi, A. Zarei, Connecting Guards with Minimum Steiner Points inside Simple Polygons, Theoretical Computer Science (775), July 2019, pp. 2631.
 A. Mashreghi, A. Zarei, When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem, Theory of Computing Systems 58(2), February 2016, pp. 287303.
 S. Alipour, M. Ghodsi, A. Zarei, M. Pourreza, Visibility Testing and Counting, Information Processing Letters 115(9), September 2015, pp. 649654.
 Z. Rahmati, M. Abam, V. King, S. Whitesides, A. Zarei, A Simple, Faster Method for Kinetic Proximity Problems, Computational Geometry: Theory and Applications 48(4), December 2014, pp. 342359.
 A. Ahadi, A. Mozafari, A. Zarei, Touring a Sequence of Disjoint Polygons: Complexity and Extension, Theoretical Computer Science (556), June 2014, pp. 4554.
 S. Daneshpajouh, M. Ghodsi, A. Zarei, Computing Polygonal Path Simplification under Area Measures, Graphical Models 74(5), April 2012, pp. 283289.
 Z. Rahmati, A. Zarei, Kinetic Euclidean Minimum Spanning Tree in the Plane, Journal of Discrete Algorithms (16), April 2012, pp. 211.
 A. Zarei, M. Ghodsi, Efficient ObserverDependent Simplification in Polygonal Domains, Algorithmica (2011), January 14 , 2011, pp. 121.
 A. Zarei, M. Ghodsi, A practical approach for planar visibility maintenance, International Journal for Geometry and Graphics, Volume 13, No. 1, 2009, pp. 116.
 M. A. Abam, M. de Berg, P. Hachenberger, and A. Zarei, Streaming Algorithms for Line Simplification, Discrete Computational Geometry, Volume 43, No. 3, 2010, pp. 497515.
 A. Zarei, M. Ghodsi, Query Point Visibility Computation in Polygons with Holes, Computational Geometry: Theory and Applications, Volume 39, Issue 2, February 2008, pp. 7890.
 A. Zarei, M. Ghodsi, A New Algorithm for Guarding Triangulated Irregular Networks, CSI journal of Computer Science and Engineering, Volume 2, No. 2&4, Summer 2004 & Winter 2005, pp. 1117.
Conferences
 A. Ahadi, A. Zarei, On Connecting with Neighborhoods: Complexity and Algorithms, Third Iranian Conference on Computational Geometry(ICCG'2020), Tehran, Iran, February 19, 2020.
 H. Boomari, M. Ostovari, A. Zarei, Recognizing Visibility Graphs of TINs, Second Iranian Conference on Computational Geometry(ICCG'2019), Tehran, Iran, February 19, 2019.
 H. Boomari, M. Ostovari, A. Zarei, Recognizing Visibility Graphs of Polygons with Holes, 35th European Workshop on Computational Geometry(EuroCG'2019), Utrecht, Netherlands, March 1820, 2019.
 S. Hajiaghaei, A. Zarei, Covering Points by Triangles, First Iranian Conference on Computational Geometry(ICCG'2018), Tehran, Iran, February 27, 2018.
 A. Ahadi, A. Zarei, Connected Guards in a Simple Polygon, First Iranian Conference on Computational Geometry(ICCG'2018), Tehran, Iran, February 27, 2018.
 A. Ahadi, A. Mozafari, A. Zarei, Touring Convex Polygons in Polygonal Domain Fences, 11th Conference on Combinatorial Optimization and Applications (COCOA'2017), pp. 6175, Shanghai, China, December 1618, 2017.
 H. Khojamli, A. Zarei, Connected Covering for Rectangular Planar Subdivisions, (in Persian), 21st CSI Computer Conference (CSICC'2016).
 A. Mozafari, A. Zarei, Touring a Sequence of Line Segments in Polygonal Domain Fences, 27th Canadian Conference on Computational Geometry (CCCG'2015), Kingston, Ontario, Canada, August 1012, 2015.
 Z.S. Emamy, A. Zarei, PseudoTriangulating a Simple Polygon from Its Visibility Graph, (in Persian), 20st CSI Computer Conference (CSICC'2015).
 H. Boumari, A. Zarei, Visibility Graphs of Anchor Polygons, The First IFIP International Conference on Topics in Theoretical Computer Science(TTCS 2015) , pp. 7289, IPM, Tehran, Iran, August 2628, 2015.
 G. Emadi, A. Zarei, All Approximating Segments for a Sequence of Points, 26th Canadian Conference on Computational Geometry (CCCG'2014), pp. 436442, Halifax, Nova Scotia, Canada, August 1113, 2014.
 A. Ahadi, A. Mozafari, A. Zarei, Touring Disjoint Polygons Problem is NPHard, COCOA 2013, Chengdu, China, LNCS (Volume 8287) by SpringerVerlag, 2013, pp. 351360.
 M. Abam, Z. Rahmati, A. Zarei, Kinetic Pie Delaunay Graph and Its Applications, SWAT 2012, Helsinki, Finland, LNCS (Volume 7357) by SpringerVerlag, 2012, pp. 4858.
 A. Mozafari, A. Zarei, Touring Polygons: An Approximation Algorithm, IWOCA 2012, Tamil Nadu, India, LNCS (Volume 7643) by SpringerVerlag, 2012, pp. 110121.
 Z. Rahmati, A. Zarei, Kinetic Euclidean Minimum Spanning Tree in the Plane, IWOCA 2011, Winnipeg, Canada, LNCS (Volume 7056) by SpringerVerlag, 2011, pp. 261274.
 S. Alipour, A. Zarei, Visibility Testing and Counting, FAWAAIM 2011, Jinhua, China, LNCS (Volume 6681) by SpringerVerlag, 2011, pp. 343351.
 Z. Rahmati, A. Zarei, Combinatorial Changes of Euclidean Minimum Spanning Tree of Moving Points in the Plane, 22th Canadian Conference on Computational Geometry (CCCG'2010), pp. 4345, Winnipeg, Manitoba, Canada, August 911, 2010.
 S. Daneshpajouh, A. Zarei, M. Ghodsi, On Realistic Line Simplification under Area Measure, The 2009 IAENG International Conference on Computer Science (ICCS'09), Hong Kong, 1820 March, 2009, pp. 465470.
 Z. Rahmati, A. Zarei, Euclidean Minimum Spaning Tree for Moving Points, (in Persian), 15st CSI Computer Conference (CSICC'2009).
 S. Daneshpajouh, A. Zarei, M. Ghodsi, Line Simplification under DifferenceArea Measure, 15st CSI Computer Conference (CSICC'2009).
 A. Zarei, M. Ghodsi, On Planar Visibility Polygon Simplification, 24th European Workshop on Computational Geometry, March 1820, 2008, Nancy, France.
 A. A. Khosravi, A. Zarei, M. Ghodsi, Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon, 19th Canadian Conference on Computational Geometry (CCCG'2007), pp. 249252, Ottawa, Canada, August 2022, 2007.
 Mos. NouriBygi, A. Zarei, M. Ghodsi, Weak Visibility of Two Objects in Planar Polygonal Scenes, 7th Annual International Workshop on Computational Geometry and Applications (CGA'07), Kuala Lumpur, Malaysia, LNCS (Volume 4705) by SpringerVerlag, 2007, pp. 6881.
 M. A. Abam, M. de Berg, P. Hachenberger, and A. Zarei, Streaming Algorithms for Line Simplification, 23rd ACM Symp. on Computational Geometry (SoCG), pp.175183, 2007.
 A. Zarei, M. Ghodsi, Exact Visibility Maintenance in Planar Polygonal Scenes in Practical Applications, 12th CSI Computer Conference (CSICC'2006), Shahid Beheshti University, Tehran, Feb 2022, 2007.
 M. A. Abam, M. de Berg, P. Hachenberger, and A. Zarei, Streaming Algorithms for Line Simplification under the Frechet Distance, 23rd European Workshop on Computational Geometry, pp. 7780, 2007.
 Moj. NouriBaygi, A. Zarei, M. Ghodsi, Optimal Maintenance of 3D Visibility Complex, (in Persian), 11th CSI Computer Conference (CSICC'2006), IPM School of Computer Science, Tehran, Jan 2426, 2006.
 A. Zarei, A. A. Khosravi, M. Ghodsi, Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes, 11th CSI Computer Conference (CSICC'2006), IPM School of Computer Science, Tehran, Jan 2426, 2006.
 A. Zarei, M Ghodsi, Efficient Computation of Query Point Visibility in Polygons with Holes, 21st Annual ACM Symposium on Computational Geometry, June 68, 2005, Pisa, Italy, pp. 314320.
 A. Zarei and M. Ghodsi, Some Results on Computing the Visibility of a Query Point inside Polygons with Holes, 10th CSI Computer Conference (CSICC'2005), Iran Telecommunication Research Center, Tehran Feb 1517, 2005, pp. 222229.
 A. Zarei and M. Ghodsi, A new algorithm for guarding on Triangulated Irregular Networks, (in Persian), 8th CSI Computer Conference (CSICC'2003), Firdausi University of Mashhad, Feb 2528, 2003.
 A. Zarei and M. Ghodsi, Graph Coloring Using Network Flows, (in Persian), 7th CSI Computer Conference (CSICC'2002), Iran Telecommunication Research Center, March 35, 2002, pp. 7279.
Thesis
 A. Zarei, Efficient Visibility Computation and Simplification in Different Environments , Ph.D. Thesis, Computer Engineering Department, Sharif University of Technology, under supervission of Prof. M. Ghodsi, November 2008.
 A. Zarei, Approximation Algorithms for Minimum Guard Set on Triangulated Irregular Networks, M.S. Thesis, Computer Engineering Department, Sharif University of Technology, under supervission of Prof. M. Ghodsi, November 2002.
 A. Zarei, A Reusable Web Access Controlling System, B.Sc Thesis, Computer Engineering Department, Sharif University of Technology, under supervission of Dr. S. H. Mirian, January 2001.
Students
PhD Students
 Mojtaba Ostovari, Thesis: Minimum Feedback Arc Set,
 Hourie Mehrabiun, Thesis: Rank Aggregation and Its Applications,
 Hossein Boomari, Thesis: Recognizing and reconstruction of visibility graphs of simple polygons,
 Arash Ahadi, Thesis: Conditional Geometric Touring and Connectedness, Graduated in Jan. 2019
Master Students
 Arash Jafari Fehkordi, Thesis: Optimization of Bread Supply Chain by Using Machine Learning,Graduated in March 2023
 Nastaran Behrouznia, Thesis: Observerdependent TIN Simplification based on Visibility Graph,Graduated in Feb. 2023
 Ali Moradi Kouchi, Thesis: Triangulated Mesh Simplification algorithm,Graduated in June 2022
 Arash Azizian Foumani, Thesis: Efficient Data Structures for Spatiotemporal Data,Graduated in July 2020
 Mina Yazdani Ghoshchi, Thesis: Reconstruction of Visibility Graph Using Heuristic Approachs,Graduated in June 2019
 Amir Tavassolian, Thesis: Computing Shortest Path and Minimum Spanning Tree under Uncertainty,Graduated in Jan. 2019
 Ayda Esmaradi, Thesis: How a Change in Visibility Graph Affects its Underlying Polygon, Graduated in June 2018
 Soheila Farrokhi, Thesis: Finding the Hamiltonian Cycle Corresponding to the Boundary of a Polygon in its Visibility Graph, Graduated in Jan. 2018
 Mojtaba Ostovari Deylamani, Thesis: On Characterizing TIN Visibility Graphs, Graduated in Sep. 2017
 Majid Javan, Thesis: A Novel Method for Path Reconstruction Using Visibility Graph, Graduated in Jan. 2017
 Shahla Naseri, Thesis: Line Simplification Using Hausdroff Distance as Error Metric, Graduated in Sep. 2015
 Masoud Abdi, Thesis: Coreset Recognition in Online Data Stream, Graduated in Sep. 2015
 Sima Hajiaghaei Shanjani, Thesis: Geometric Algorithms For Points Covering Problem, Graduated in Jan. 2015
 ZahraSadat Emamy, Thesis: Characterizing an Environment from Visibility Information, Graduated in Sep. 2014
 Navid Asadian, Thesis: Separating colored Points, Graduated in Sep. 2014
 Ali Mashreghi, Thesis: Bicriteria Network Design Problems, Graduated in Sep. 2014
 Mehrdad Khavarian, Thesis: Unsupervised Pattern Recognition In Data Streams, Graduated in Jan. 2014
 Masoumeh Panahi Shahri, Thesis: Guarding a Terrain by WatchTowers, Graduated in Sep. 2013
 Hossein Boomari, Thesis: MultiCamera 3DReconstruction and Using MultiCamera for Mobile RealTime 3DReconstruction, Graduated in Sep. 2013
 Halimeh Khojamli, Thesis: Connected Covering of a Rectangulared Planar Subdivision, Graduated in Sep. 2013
 Sahar Mehrpour, Thesis: Reconstructing an Environment from Visibility Information, Graduated in Sep. 2013
 Mohammad Javad Davari, Thesis: Navigation with Minimum Link Path, Graduated in Oct. 2012
 Farnaz Tehranchi, Thesis: Computational Geometry Problems in Black Box Model, Graduated in Oct. 2012
 Gobad Emadi, Thesis: Path Simplification, Graduated in Dec. 2011
 Sharareh Alipour, Thesis: Planar Visibility Counting, Graduated in Sep. 2011
 Mohammad Hasanzadeh, Thesis: Using Recurrent Neural Networks for Robot Motion Planning, Graduated in Dec. 2010
 Fatemeh Emamian, Thesis: IOEfficient Algorithms and Data Structures for Geometric Problems, Graduated in Dec. 2010
 Zahed Rahmati, Thesis: Studying Proximity Problems on Moving Points, Graduated in Aug. 2010
Teaching Experiences
Graduate Courses
 Theory of Computer Science
 Computational Geometry
 Advanced Algorithms
 Randomized Algorithms
 Matrix Computation
 Randomized Algorithms
UnderGraduate Courses
 Introduction to the Theory of Languages and Automata
 Design and Analysis of Algorithms
 Operating Systems
 Discrete Mathematics
 Databases
 Data Structures
 Advanced Programming
 Basic Computer Programming
 An Introduction to the Computer Science
Familiarity with Computer Environments
 Operating Systems : Microsoft Windows families, LinuxBased Operating Systems
 Programming Languages : JAVA, C/C++, Pascal/Delphi, HTML/DHTML/Java Script/PHP
 DBMSs :Oracle, MS SQL Server, PostgreSQL, MySQL, MS Access.
Professional Experiences
 Project Manager, System Analyst, Designer and Programmer for more than two decades.
Links
Last Modified: May 19, 2024