Zahed Rahmati

Orcid: 0000-0002-6942-3453

According to our database1, Zahed Rahmati authored at least 27 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Relational Graph Convolutional Networks for Sentiment Analysis.
CoRR, 2024

2023
Emanation Graph: A Plane Geometric Spanner with Steiner Points.
Graphs Comb., 2023

Edge2Node: Reducing Edge Prediction to Node Classification.
CoRR, 2023

On Enhancement of Text Classification and Analysis of Text Emotions Using Graph Machine Learning and Ensemble Learning Methods on Non-English Datasets.
Algorithms, 2023

2022
Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7].
Comput. Geom., 2022

2021
BERT-DRE: BERT with Deep Recursive Encoder for Natural Language Sentence Matching.
CoRR, 2021

2020
RAC drawings in subcubic area.
Inf. Process. Lett., 2020

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
Kinetic <i>k</i>-Semi-Yao graph and its applications.
Comput. Geom., 2019

2018
An improved approximation algorithm for the discrete Fréchet distance.
Inf. Process. Lett., 2018

A Clustering-Based Approach to Kinetic Closest Pair.
Algorithmica, 2018

Width and Bounding Box of Imprecise Points.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Emanation Graph: A New t-Spanner.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points.
Comput. Geom., 2017

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

Online Packing of Equilateral Triangles.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Simple, Faster Kinetic Data Structures.
PhD thesis, 2014

Kinetic $k$-Semi-Yao Graph and its Applications.
CoRR, 2014

(Reverse) <i>k</i>-nearest neighbors for moving objects.
Proceedings of the Seventh International Conference on Motion in Games, Playa Vista, CA, USA, November 06, 2014

Kinetic Reverse k-Nearest Neighbor Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$.
CoRR, 2013

Kinetic data structures for all nearest neighbors and closest pair in the plane.
Proceedings of the Symposium on Computational Geometry 2013, 2013

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

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

Kinetic and Stationary Point-Set Embeddability for Plane Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

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


  Loading...