Alireza Zarei

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 12

Top Topics

Correlation Clustering

Digital Convexity

Top Venues

Theor. Comput. Sci.

Publications

Mojtaba Ostovari, Alireza Zarei
A better LP rounding for feedback arc set on tournaments. Theor. Comput. Sci. 1015 (2024)
Mojtaba Ostovari, Alireza Zarei
A Combinatorial Approximation Algorithm for Correlation Clustering. CoRR (2023)
Hossein Boomari, Alireza Zarei
Visibility Graphs of Anchor Polygons. J. Graph Algorithms Appl. 26 (1) (2022)
Alireza Zarei, Yim Seung-Bin, Matej Durco, Klaus Illmayer, Laure Barbot, Frank Fischer, Edward Gray
Der SSH Open Marketplace - Kontextualisiertes Praxiswissen für die Digital Humanities. DHd (2022)
Hossein Boomari, Mojtaba Ostovari, Alireza Zarei
Recognizing Visibility Graphs of Triangulated Irregular Networks. CoRR (2021)
Hossein Boomari, Mojtaba Ostovari, Alireza Zarei
Recognizing Visibility Graphs of Triangulated Irregular Networks. Fundam. Informaticae 179 (4) (2021)
Navid Assadian, Sima Hajiaghaei Shanjani, Alireza Zarei
Separating Colored Points with Minimum Number of Rectangles. CoRR (2021)
Arash Ahadi, Alireza Zarei
Connecting guards with minimum Steiner points inside simple polygons. Theor. Comput. Sci. 775 (2019)
Sahar Mehrpour, Alireza Zarei
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction. CoRR (2019)
Hossein Boomari, Mojtaba Ostovari, Alireza Zarei
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons. CoRR (2018)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring Convex Polygons in Polygonal Domain Fences. COCOA (2) (2017)
Ali Mashreghi, Alireza Zarei
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem. Theory Comput. Syst. 58 (2) (2016)
Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza
Visibility testing and counting. Inf. Process. Lett. 115 (9) (2015)
Hossein Boomari, Alireza Zarei
Visibility Graphs of Anchor Polygons. TTCS (2015)
Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei
A simple, faster method for kinetic proximity problems. Comput. Geom. 48 (4) (2015)
Amirhossein Mozafari, Alireza Zarei
Touring a Sequence of Line Segments in Polygonal Domain Fences. CCCG (2015)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring a sequence of disjoint polygons: Complexity and extension. Theor. Comput. Sci. 556 (2014)
Ghobad Emadi, Alireza Zarei
All Approximating Segments for a Sequence of Points. CCCG (2014)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring Disjoint Polygons Problem Is NP-Hard. COCOA (2013)
Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei
A Simple, Faster Method for Kinetic Proximity Problems. CoRR (2013)
Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei
Kinetic Pie Delaunay Graph and Its Applications. SWAT (2012)
Zahed Rahmati, Alireza Zarei
Kinetic Euclidean minimum spanning tree in the plane. J. Discrete Algorithms 16 (2012)
Amirhossein Mozafari, Alireza Zarei
Touring Polygons: An Approximation Algorithm. IWOCA (2012)
Shervin Daneshpajouh, Mohammad Ghodsi, Alireza Zarei
Computing polygonal path simplification under area measures. Graph. Model. 74 (5) (2012)
Alireza Zarei, Mohammad Ghodsi
Efficient Observer-Dependent Simplification in Polygonal Domains. Algorithmica 62 (3-4) (2012)
Zahed Rahmati, Alireza Zarei
Kinetic Euclidean Minimum Spanning Tree in the Plane. IWOCA (2011)
Sharareh Alipour, Alireza Zarei
Visibility Testing and Counting. FAW-AAIM (2011)
Mahroo Zandrahimi, Alireza Zarei, Hamid R. Zarandi
A Probabilistic Method to Detect Anomalies in Embedded Systems. DFT (2010)
Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei
Streaming Algorithms for Line Simplification. Discret. Comput. Geom. 43 (3) (2010)
Zahed Rahmati, Alireza Zarei
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. CCCG (2010)
Alireza Zarei, Mohammad Ghodsi
Query point visibility computation in polygons with holes. Comput. Geom. 39 (2) (2008)
Amirali Khosravi, Alireza Zarei, Mohammad Ghodsi
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon. CCCG (2007)
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
Weak Visibility of Two Objects in Planar Polygonal Scenes. ICCSA (1) (2007)
Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei
Streaming algorithms for line simplification. SCG (2007)
Alireza Zarei, Mohammad Ghodsi
Efficient computation of query point visibility in polygons with holes. SCG (2005)