Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli D. Mehrabi
Person information
- affiliation: VU Amsterdam, Department of Computer Science, The Netherlands
- affiliation (Ph.D.): Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j5]Mikkel Abrahamsen
, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63(2): 483-505 (2020)- 2018
- [j4]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. Algorithmica 80(11): 3253-3269 (2018) - 2017
- [j3]Farnaz Sheikhi, Ali Mohades, Mark de Berg, Ali D. Mehrabi:
Separability of imprecise points. Comput. Geom. 61: 24-37 (2017) - [j2]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
Guarding orthogonal art galleries with sliding cameras. Comput. Geom. 65: 12-26 (2017) - 2016
- [j1]Mark de Berg, Ali D. Mehrabi:
Straight-path queries in trajectory data. J. Discrete Algorithms 36: 27-38 (2016)
Conference and Workshop Papers
- 2017
- [c10]Mark de Berg, Ali D. Mehrabi, Tim Ophelders:
Data Structures for Fréchet Queries in Trajectory Data. CCCG 2017: 214-219 - [c9]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. SoCG 2017: 4:1-4:15 - [c8]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. SoCG 2017: 5:1-5:16 - [c7]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. SIGSPATIAL/GIS 2017: 48:1-48:4 - 2015
- [c6]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. WADS 2015: 236-248 - [c5]Mark de Berg, Ali D. Mehrabi:
Straight-Path Queries in Trajectory Data. WALCOM 2015: 101-112 - 2014
- [c4]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. LATIN 2014: 294-305 - [c3]Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi:
Separability of Imprecise Points. SWAT 2014: 146-157 - 2009
- [c2]Saeed Mehrabi, Abbas Mehrabi, Ali D. Mehrabi:
A New Hybrid Genetic Algorithm for Maximum Independent Set Problem. ICSOFT (2) 2009: 314-317 - [c1]Ali D. Mehrabi, Saeed Mehrabi, Abbas Mehrabi:
A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem. IJCCI 2009: 281-286
Informal and Other Publications
- 2017
- [i4]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. CoRR abs/1703.05549 (2017) - [i3]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. CoRR abs/1705.06242 (2017) - 2015
- [i2]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. CoRR abs/1502.06079 (2015) - 2009
- [i1]Farzad Didehvar, Ali D. Mehrabi, Fatemeh Raee B:
On Unique Independence Weighted Graphs. CoRR abs/0907.0088 (2009)
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 2024-01-24 20:37 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:
