Ahmad Biniaz
Ahmad Biniaz
Assistant Professor, University of Windsor
Verified email at uwindsor.ca - Homepage
Title
Cited by
Cited by
Year
Approximation algorithms for the unit disk cover problem in 2D and 3D
A Biniaz, P Liu, A Maheshwari, M Smid
Computational Geometry 60, 8-18, 2017
262017
A faster circle-sweep Delaunay triangulation algorithm
A Biniaz, G Dastghaibyfard
Advances in Engineering Software 43 (1), 1-13, 2012
242012
Approximating the bottleneck plane perfect matching of a point set
AK Abu-Affash, A Biniaz, P Carmi, A Maheshwari, M Smid
Computational Geometry 48 (9), 718-731, 2015
132015
Bottleneck Bichromatic Plane Matching of Points.
A Biniaz, A Maheshwari, MHM Smid
CCCG, 2014
112014
Plane bichromatic trees of low degree
A Biniaz, P Bose, A Maheshwari, M Smid
Discrete & Computational Geometry 59 (4), 864-885, 2018
102018
Fixed-orientation equilateral triangle matching of point sets
J Babu, A Biniaz, A Maheshwari, M Smid
Theoretical Computer Science 555, 55-70, 2014
102014
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties
A Biniaz, A Maheshwari, M Smid
Computational Geometry 48 (9), 646-660, 2015
92015
Slope fidelity in terrains with higher-order Delaunay triangulations
A Biniaz, G Dastghaibyfard
Václav Skala-UNION Agency, 2008
92008
A plane 1.88-spanner for points in convex position
M Amani, A Biniaz, P Bose, JL De Carufel, A Maheshwari, M Smid
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016
82016
Drainage reality in terrains with higher-order Delaunay triangulations
A Biniaz, G Dastghaibyfard
Advances in 3D geoinformation systems, 199-211, 2008
82008
Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
J Grygierek, C Thäle
Statistics & Probability Letters 158, 108674, 2020
7*2020
Spanning trees in multipartite geometric graphs
A Biniaz, P Bose, D Eppstein, A Maheshwari, P Morin, M Smid
Algorithmica 80 (11), 3177-3191, 2018
72018
Towards plane spanners of degree 3
A Biniaz, P Bose, JL De Carufel, C Gavoille, A Maheshwari, M Smid
arXiv preprint arXiv:1606.08824, 2016
72016
On the hardness of full Steiner tree problems
A Biniaz, A Maheshwari, M Smid
Journal of Discrete Algorithms 34, 118-127, 2015
72015
Packing plane perfect matchings into a point set
A Biniaz, P Bose, A Maheshwari, M Smid
arXiv preprint arXiv:1501.03686, 2015
72015
On the minimum consistent subset problem
A Biniaz, S Cabello, P Carmi, JL De Carufel, A Maheshwari, S Mehrabi, ...
Workshop on Algorithms and Data Structures, 155-167, 2019
62019
Ideal Drawings of Rooted Trees With Approximately Optimal Width.
TC Biedl
J. Graph Algorithms Appl. 21 (4), 631-648, 2017
62017
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
A Biniaz, P Bose, A Maheshwari, M Smid
Computational Geometry 57, 27-39, 2016
62016
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
A Biniaz, A Maheshwari, M Smid
Computational Geometry 47 (3), 377-380, 2014
62014
Maximum plane trees in multipartite geometric graphs
A Biniaz, P Bose, K Crosbie, JL De Carufel, D Eppstein, A Maheshwari, ...
Algorithmica 81 (4), 1512-1534, 2019
52019
The system can't perform the operation now. Try again later.
Articles 1–20