Zahed Rahmati

Debajyoti Mondal

Graphs Comb., 2023

Edge2Node: Reducing Edge Prediction to Node Classification.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

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].

[BibT_eX]

[DOI]

Comput. Geom., 2022

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

RAC drawings in subcubic area.

[BibT_eX]

[DOI]

Fatemeh Emami

Inf. Process. Lett., 2020

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points.

[BibT_eX]

[DOI]

Bardia Hamedmohseni

Debajyoti Mondal

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Kinetic <i>k</i>-Semi-Yao graph and its applications.

[BibT_eX]

[DOI]

Comput. Geom., 2019

2018

An improved approximation algorithm for the discrete Fréchet distance.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

A Clustering-Based Approach to Kinetic Closest Pair.

[BibT_eX]

[DOI]

Algorithmica, 2018

Width and Bounding Box of Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Emanation Graph: A New t-Spanner.

[BibT_eX]

[DOI]

Bardia Hamedmohseni

Debajyoti Mondal

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.

[BibT_eX]

[DOI]

Comput. Geom., 2017

2015

A simple, faster method for kinetic proximity problems.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Online Packing of Equilateral Triangles.

[BibT_eX]

[DOI]

Shahin Kamali

Alejandro López-Ortiz

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Simple, Faster Kinetic Data Structures.

[BibT_eX]

[DOI]

PhD thesis, 2014

Kinetic $k$-Semi-Yao Graph and its Applications.

[BibT_eX]

[DOI]

CoRR, 2014

(Reverse) <i>k</i>-nearest neighbors for moving objects.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Motion in Games, Playa Vista, CA, USA, November 06, 2014

Kinetic Reverse k-Nearest Neighbor Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d.

[BibT_eX]

[DOI]

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$.

[BibT_eX]

[DOI]

Mohammad Ali Abam

CoRR, 2013

Kinetic data structures for all nearest neighbors and closest pair in the plane.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Kinetic Euclidean minimum spanning tree in the plane.

[BibT_eX]

[DOI]

Alireza Zarei

J. Discrete Algorithms, 2012

Kinetic Pie Delaunay Graph and Its Applications.

[BibT_eX]

[DOI]

Mohammad Ali Abam

Alireza Zarei

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Kinetic and Stationary Point-Set Embeddability for Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2010

Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.

[BibT_eX]

[DOI]