default search action
Zahed Rahmati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Asal Khosravi, Zahed Rahmati, Ali Vefghi:
Relational Graph Convolutional Networks for Sentiment Analysis. CoRR abs/2404.13079 (2024) - 2023
- [j10]Fatemeh Gholami, Zahed Rahmati
, Alireza Mofidi, Mostafa Abbaszadeh
On Enhancement of Text Classification and Analysis of Text Emotions Using Graph Machine Learning and Ensemble Learning Methods on Non-English Datasets. Algorithms 16(10): 470 (2023) - [j9]Bardia Hamedmohseni, Zahed Rahmati
Emanation Graph: A Plane Geometric Spanner with Steiner Points. Graphs Comb. 39(2): 38 (2023) - [i8]Zahed Rahmati:
Edge2Node: Reducing Edge Prediction to Node Classification. CoRR abs/2311.02921 (2023) - 2022
- [j8]Timothy M. Chan, Zahed Rahmati:
Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]. Comput. Geom. 101: 101831 (2022) - 2021
- [i7]Ehsan Tavan, Ali Rahmati, Maryam Najafi, Saeed Bibak, Zahed Rahmati:
BERT-DRE: BERT with Deep Recursive Encoder for Natural Language Sentence Matching. CoRR abs/2111.02188 (2021) - 2020
- [j7]Zahed Rahmati
RAC drawings in subcubic area. Inf. Process. Lett. 159-160: 105945 (2020) - [c14]Bardia Hamedmohseni, Zahed Rahmati
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. SOFSEM 2020: 607-616 - [i6]Zahed Rahmati, Fatemeh Emami:
RAC Drawings in Subcubic Area. CoRR abs/2001.02867 (2020)
2010 – 2019
- 2019
- [j6]Zahed Rahmati
Kinetic k-Semi-Yao graph and its applications. Comput. Geom. 77: 10-26 (2019) - [i5]Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. CoRR abs/1910.10376 (2019) - 2018
- [j5]Zahed Rahmati
A Clustering-Based Approach to Kinetic Closest Pair. Algorithmica 80(10): 2742-2756 (2018) - [j4]Timothy M. Chan, Zahed Rahmati
An improved approximation algorithm for the discrete Fréchet distance. Inf. Process. Lett. 138: 72-74 (2018) - [c13]Vahideh Keikha, Maarten Löffler, Ali Mohades, Zahed Rahmati:
Width and Bounding Box of Imprecise Points. CCCG 2018: 142-148 - [c12]Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Emanation Graph: A New t-Spanner. CCCG 2018: 311-317 - 2017
- [j3]Timothy M. Chan, Zahed Rahmati
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. Comput. Geom. 60: 2-7 (2017) - 2016
- [c11]Timothy M. Chan, Zahed Rahmati
A Clustering-Based Approach to Kinetic Closest Pair. SWAT 2016: 28:1-28:13 - 2015
- [j2]Zahed Rahmati
A simple, faster method for kinetic proximity problems. Comput. Geom. 48(4): 342-359 (2015) - [c10]Timothy M. Chan, Zahed Rahmati
Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. CCCG 2015 - [c9]Shahin Kamali, Alejandro López-Ortiz, Zahed Rahmati
Online Packing of Equilateral Triangles. CCCG 2015 - 2014
- [b1]Zahed Rahmati:
Simple, Faster Kinetic Data Structures. University of Victoria, Canada, 2014 - [c8]Zahed Rahmati
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. CCCG 2014 - [c7]Zahed Rahmati
Kinetic Reverse k-Nearest Neighbor Problem. IWOCA 2014: 307-317 - [c6]Zahed Rahmati
(Reverse) k-nearest neighbors for moving objects. MIG 2014: 187 - [i4]Zahed Rahmati, Valerie King, Sue Whitesides:
Kinetic Reverse $k$-Nearest Neighbor Problem. CoRR abs/1406.5554 (2014) - [i3]Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides:
Kinetic $k$-Semi-Yao Graph and its Applications. CoRR abs/1412.5697 (2014) - 2013
- [c5]Zahed Rahmati
Kinetic data structures for all nearest neighbors and closest pair in the plane. SoCG 2013: 137-144 - [i2]Zahed Rahmati, Mohammad Ali Abam:
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$. CoRR abs/1307.2700 (2013) - [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
- [j1]Zahed Rahmati
Kinetic Euclidean minimum spanning tree in the plane. J. Discrete Algorithms 16: 2-11 (2012) - [c4]Zahed Rahmati
Kinetic and Stationary Point-Set Embeddability for Plane Graphs. GD 2012: 279-290 - [c3]Mohammad Ali Abam, Zahed Rahmati
Kinetic Pie Delaunay Graph and Its Applications. SWAT 2012: 48-58 - 2011
- [c2]Zahed Rahmati
Kinetic Euclidean Minimum Spanning Tree in the Plane. IWOCA 2011: 261-274 - 2010
- [c1]Zahed Rahmati
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. CCCG 2010: 43-45
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-05-27 21:50 CEST 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: