default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlireza Zarei
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Alireza Zarei
, Navid Ghaffarzadeh, Farhad Shahnia, Miadreza Shafie-Khah:
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 12: 171617-171633 (2024)- [j14]Sorour Sheidani, Alireza Zarei:
Privacy-preserving two-party computation of line segment intersection. Int. J. Inf. Sec. 23(5): 3415-3432 (2024) - [j13]Mojtaba Ostovari, Alireza Zarei:
A better LP rounding for feedback arc set on tournaments. Theor. Comput. Sci. 1015: 114768 (2024) - 2023
- [i6]Mojtaba Ostovari, Alireza Zarei:
A Combinatorial Approximation Algorithm for Correlation Clustering. CoRR abs/2310.09638 (2023) - 2022
- [j12]Hossein Boomari, Alireza Zarei:
Visibility Graphs of Anchor Polygons. J. Graph Algorithms Appl. 26(1): 15-34 (2022) - [c16]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 - 2021
- [j11]Hossein Boomari, Mojtaba Ostovari, Alireza Zarei:
Recognizing Visibility Graphs of Triangulated Irregular Networks. Fundam. Informaticae 179(4): 345-360 (2021) - [i5]Hossein Boomari, Mojtaba Ostovari, Alireza Zarei:
Recognizing Visibility Graphs of Triangulated Irregular Networks. CoRR abs/2101.09736 (2021) - [i4]Navid Assadian, Sima Hajiaghaei Shanjani, Alireza Zarei:
Separating Colored Points with Minimum Number of Rectangles. CoRR abs/2107.09821 (2021)
2010 – 2019
- 2019
- [j10]Arash Ahadi, Alireza Zarei:
Connecting guards with minimum Steiner points inside simple polygons. Theor. Comput. Sci. 775: 26-31 (2019) - [i3]Sahar Mehrpour, Alireza Zarei:
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction. CoRR abs/1905.00727 (2019) - 2018
- [i2]Hossein Boomari, Mojtaba Ostovari, Alireza Zarei:
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons. CoRR abs/1804.05105 (2018) - 2017
- [c15]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Convex Polygons in Polygonal Domain Fences. COCOA (2) 2017: 61-75 - 2016
- [j9]Ali Mashreghi, Alireza Zarei:
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem. Theory Comput. Syst. 58(2): 287-303 (2016) - 2015
- [j8]Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei:
A simple, faster method for kinetic proximity problems. Comput. Geom. 48(4): 342-359 (2015) - [j7]Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza:
Visibility testing and counting. Inf. Process. Lett. 115(9): 649-654 (2015) - [c14]Amirhossein Mozafari, Alireza Zarei:
Touring a Sequence of Line Segments in Polygonal Domain Fences. CCCG 2015 - [c13]Hossein Boomari, Alireza Zarei:
Visibility Graphs of Anchor Polygons. TTCS 2015: 72-89 - 2014
- [j6]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring a sequence of disjoint polygons: Complexity and extension. Theor. Comput. Sci. 556: 45-54 (2014) - [c12]Ghobad Emadi, Alireza Zarei:
All Approximating Segments for a Sequence of Points. CCCG 2014 - 2013
- [c11]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Disjoint Polygons Problem Is NP-Hard. COCOA 2013: 351-360 - [i1]Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei:
A Simple, Faster Method for Kinetic Proximity Problems. CoRR abs/1311.2032 (2013) - 2012
- [j5]Alireza Zarei, Mohammad Ghodsi:
Efficient Observer-Dependent Simplification in Polygonal Domains. Algorithmica 62(3-4): 842-862 (2012) - [j4]Shervin Daneshpajouh, Mohammad Ghodsi, Alireza Zarei:
Computing polygonal path simplification under area measures. Graph. Model. 74(5): 283-289 (2012) - [j3]Zahed Rahmati, Alireza Zarei:
Kinetic Euclidean minimum spanning tree in the plane. J. Discrete Algorithms 16: 2-11 (2012) - [c10]Amirhossein Mozafari, Alireza Zarei:
Touring Polygons: An Approximation Algorithm. IWOCA 2012: 110-121 - [c9]Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei:
Kinetic Pie Delaunay Graph and Its Applications. SWAT 2012: 48-58 - 2011
- [c8]Sharareh Alipour, Alireza Zarei:
Visibility Testing and Counting. FAW-AAIM 2011: 343-351 - [c7]Zahed Rahmati, Alireza Zarei:
Kinetic Euclidean Minimum Spanning Tree in the Plane. IWOCA 2011: 261-274 - 2010
- [j2]Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei:
Streaming Algorithms for Line Simplification. Discret. Comput. Geom. 43(3): 497-515 (2010) - [c6]Zahed Rahmati, Alireza Zarei:
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. CCCG 2010: 43-45 - [c5]Mahroo Zandrahimi, Alireza Zarei, Hamid R. Zarandi:
A Probabilistic Method to Detect Anomalies in Embedded Systems. DFT 2010: 152-159
2000 – 2009
- 2008
- [j1]Alireza Zarei, Mohammad Ghodsi:
Query point visibility computation in polygons with holes. Comput. Geom. 39(2): 78-90 (2008) - 2007
- [c4]Amirali Khosravi, Alireza Zarei, Mohammad Ghodsi:
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon. CCCG 2007: 249-252 - [c3]Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei:
Streaming algorithms for line simplification. SCG 2007: 175-183 - [c2]Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi:
Weak Visibility of Two Objects in Planar Polygonal Scenes. ICCSA (1) 2007: 68-81 - 2005
- [c1]Alireza Zarei, Mohammad Ghodsi:
Efficient computation of query point visibility in polygons with holes. SCG 2005: 314-320
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
