Alireza Zarei

Orcid: 0000-0002-9772-7585

According to our database1, Alireza Zarei authored at least 32 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Privacy-preserving two-party computation of line segment intersection.
Int. J. Inf. Sec., October, 2024

A better LP rounding for feedback arc set on tournaments.
Theor. Comput. Sci., 2024

Optimal Scheduling of Demand Response-Based AC OPF by Smart Power Grid' Flexible Loads Considering User Convenience, LSTM-Based Load Forecasting, and DERs Uncertainties.
IEEE Access, 2024

2023
A Combinatorial Approximation Algorithm for Correlation Clustering.
CoRR, 2023

2022
Visibility Graphs of Anchor Polygons.
J. Graph Algorithms Appl., 2022

Der SSH Open Marketplace - Kontextualisiertes Praxiswissen für die Digital Humanities.
Proceedings of the 8. Tagung des Verbands Digital Humanities im deutschsprachigen Raum, 2022

2021
Recognizing Visibility Graphs of Triangulated Irregular Networks.
Fundam. Informaticae, 2021

Separating Colored Points with Minimum Number of Rectangles.
CoRR, 2021

2019
Connecting guards with minimum Steiner points inside simple polygons.
Theor. Comput. Sci., 2019

Pseudo-Triangle Visibility Graph: Characterization and Reconstruction.
CoRR, 2019

2018
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons.
CoRR, 2018

2017
Touring Convex Polygons in Polygonal Domain Fences.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.
Theory Comput. Syst., 2016

2015
Visibility testing and counting.
Inf. Process. Lett., 2015

A simple, faster method for kinetic proximity problems.
Comput. Geom., 2015

Touring a Sequence of Line Segments in Polygonal Domain Fences.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Touring a sequence of disjoint polygons: Complexity and extension.
Theor. Comput. Sci., 2014

All Approximating Segments for a Sequence of Points.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Touring Disjoint Polygons Problem Is NP-Hard.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Kinetic Euclidean minimum spanning tree in the plane.
J. Discrete Algorithms, 2012

Computing polygonal path simplification under area measures.
Graph. Model., 2012

Efficient Observer-Dependent Simplification in Polygonal Domains.
Algorithmica, 2012

Kinetic Pie Delaunay Graph and Its Applications.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Touring Polygons: An Approximation Algorithm.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2011
Visibility Testing and Counting.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Streaming Algorithms for Line Simplification.
Discret. Comput. Geom., 2010

A Probabilistic Method to Detect Anomalies in Embedded Systems.
Proceedings of the 25th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2010

Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008
Query point visibility computation in polygons with holes.
Comput. Geom., 2008

2007
Weak Visibility of Two Objects in Planar Polygonal Scenes.
Proceedings of the Computational Science and Its Applications, 2007

Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005
Efficient computation of query point visibility in polygons with holes.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005


  Loading...