Mohammad Farshi

Soft Comput., March, 2024

On algorithmic complexity of imprecise spanners.

[BibT_eX]

[DOI]

Comput. Geom., February, 2024

2023

Algorithmic results on locating-total domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., July, 2023

2022

On the plane angle-monotone graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2022

2021

A progressive algorithm for the closest pair problem.

[BibT_eX]

[DOI]

Amir Mesrikhani

Behnam Iranfar

Int. J. Comput. Math. Comput. Syst. Theory, 2021

Angle-monotonicity of Delaunay triangulation.

[BibT_eX]

[DOI]

Comput. Geom., 2021

2020

A Degree 3 Plane 5.19-Spanner for Points in Convex Position.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Fault tolerancy of continuous Yao graph of angle less than 2<i>π</i>/5.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

(Weakly) Self-approaching geometric graphs and spanners.

[BibT_eX]

[DOI]

Comput. Geom., 2019

2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Angle-constrained spanners with angle at least π/3.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

The well-separated pair decomposition for balls.

[BibT_eX]

[DOI]

CoRR, 2017

Complexity results for k-domination and α-domination problems and their variants.

[BibT_eX]

[DOI]

Mahdieh Hasheminezhad

CoRR, 2017

2016

A lower bound for computing geometric spanners.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Visualization of Geometric Spanner Algorithms.

[BibT_eX]

[DOI]

Seyed Hossein Hosseini

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Geometric Spanners Merging and its Applications.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Some Properties of Continuous Yao Graph.

[BibT_eX]

[DOI]

Proceedings of the Topics in Theoretical Computer Science, 2015

2013

On the power of the semi-separated pair decomposition.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2011

Geometric Spanners for Weighted Point Sets.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Dilation-Optimal Edge Deletion in Polygonal Cycles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Computing the Greedy Spanner in Near-Quadratic Time.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Experimental study of geometric <i>t</i>-spanners.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Region-Fault Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

2008

Improving the Stretch Factor of a Geometric Network by Edge Augmentation.

[BibT_eX]

[DOI]

Panos Giannopoulos

SIAM J. Comput., 2008

2007

Experimental Study of Geometric t-Spanners: A Running Time Comparison.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2005

Finding the best shortcut in a geometric network.

[BibT_eX]

[DOI]

Panos Giannopoulos