Currently under review

Spanning trees in multipartite geometric graphs

A. Biniaz, P. Bose, D. Eppstein, A. Maheshwari, P. Morin, M. Smid

Towards plane spanners of degree 3

A. Biniaz, P. Bose, A. Maheshwari, J.-L. De Carufel, C. Gavoille, M. Smid

A preliminary version accepted to ISAAC 2016.

Faster algorithms for the minimum red-blue-purple spanning graph problem

A. Biniaz, P. Bose, I. van Duijn, A. Maheshwari, M. Smid

A preliminary version appeared in CCCG 2016.

Plane bichromatic trees of low degree

A. Biniaz, P. Bose, A. Maheshwari, M. Smid.

A preliminary version appeared in IWOCA 2016.

Plane and planarity thresholds for random geometric graphs

A. Biniaz, E. Kranakis, A. Maheshwari, M. Smid.

A preliminary version appeared in ALGOSENSORS 2015.

An optimal algorithm for plane matchings in multipartite geometric graphs

A. Biniaz, A. Maheshwari, S. C. Nandy, M. Smid.

A preliminary version appeared in WADS 2015.

Journal Papers

A plane 1.88-spanner for points in convex position

M. Amani, A. Biniaz, P. Bose, J.-L. De Carufel, A. Maheshwari, M. Smid.

Accepted to the Journal of Computational Geometry.

Strong matching of points with geometric shapes

A. Biniaz, A. Maheshwari, M. Smid.

Accepted to Computational Geometry: Theory and Applications, special issue in memoriam: Ferran Hurtado.

Approximation algorithms for the unit disk cover problem in 2D and 3D

A. Biniaz, P. Liu, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, special issue of CCCG'15, 60: 8–18, 2017.

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon

A. Biniaz, P. Bose, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, 57: 27–39, 2016.

Packing plane perfect matchings into a point set

A. Biniaz, P. Bose, A. Maheshwari, M. Smid.

Discrete Mathematics and Theoretical Computer Science, 17(2): 119–142, 2015.

Higher-order triangular-distance Delaunay graphs: graph-theoretical properties

A. Biniaz, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, 48(9): 646–660, 2015.

Matchings in higher-order Gabriel graphs

A. Biniaz, A. Maheshwari, M. Smid.

Theoretical Computer Science, 596: 67–78, 2015.

On the hardness of the full Steiner tree problems

A. Biniaz, A. Maheshwari, M. Smid.

Journal of Discrete Algorithms, 34: 118–127, 2015.

Approximating the bottleneck plane perfect matching of a point set

K. Abu-Affash, A. Biniaz, P. Carmi, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, 48(9): 718–731, 2015.

On full Steiner trees in unit disk graphs

A. Biniaz, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, 48(6): 453–458, 2015.

Fixed-orientation equilateral triangle matching of point sets

J. Babu, A. Biniaz, A. Maheshwari, M. Smid.

Theoretical Computer Science, special issue of WALCOM'13, 555: 55-70, 2014.

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

A. Biniaz, A. Maheshwari, M. Smid.

Computational Geometry: Theory and Applications, 47(3):377-380, 2014.

A faster circle-sweep Delaunay triangulation algorithm

A. Biniaz, G. Dastghaibyfard.

Advances in Engineering Software, 43(1):1-13, 2012.

Conference Papers

Towards plane spanners of degree 3

A. Biniaz, P. Bose, A Maheshwari, J.-L. De Carufel, C. Gavoille, M. Smid

Accepted for presentation at the 27th International Symposium on Algorithms and Computation (ISAAC 2016).

A faster algorithm for the minimum red-blue-purple spanning graph problem for points on a circle

A. Biniaz, P. Bose, I. van Duijn, A. Maheshwari, M. Smid

In Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG’16), 140-146, 2016.

Plane bichromatic trees of low degree

A. Biniaz, P. Bose, A. Maheshwari, M. Smid.

In Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA’16), 68-80, 2016.

A plane 1.88-spanner for points in convex position

M. Amani, A. Biniaz, P. Bose, J.-L. De Carufel, A. Maheshwari, M. Smid.

In Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’16), 25:1-25:14, 2016.

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

A. Biniaz, A. Maheshwari, M. Smid.

In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), 179-182, 2016.

Plane and planarity thresholds for random geometric graphs

A. Biniaz, E. Kranakis, A. Maheshwari, M. Smid.

In Proceedings of the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS’15), Lecture Notes in Computer Science, Vol. 9536, Springer, pages 1–12, 2015.

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon

A. Biniaz, P. Bose, A. Maheshwari, M. Smid.

In Proceedings of the first International Conference on Topics in Theoretical Computer Science (TTCS’15), Lecture Notes in Computer Science, Vol. 9541, Springer, pages 56–71, 2016.

A faster 4-approximation algorithm for the unit disk cover problem

A. Biniaz, P. Liu, A. Maheshwari, M. Smid.

In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG’15), pages 262–267, 2015.

An optimal algorithm for plane matchings in multipartite geometric graphs

A. Biniaz, A. Maheshwari, S. C. Nandy, M. Smid.

In Proceedings of the 14th Algorithms and Data Structures Symposium (WADS’15), Lecture Notes in Computer Science, Vol. 9214, Springer-Verlag, Berlin, pages 66–78, 2015.

Higher-order triangular-distance Delaunay graphs: graph-theoretical properties

A. Biniaz, A. Maheshwari, M. Smid.

In Proceedings of the first International Conference on Algorithms and Discrete Applied Mathematics (CALDAM'15), Lecture Notes in Computer Science, Vol. 8959, Springer, pages 89–100, 2015.

Approximating full Steiner tree in a unit disk graph

A. Biniaz, A. Maheshwari, M. Smid.

In Proceedings of the 26th Canadian Conference in Computational Geometry (CCCG'14), pages 113-117, 2014.

Bottleneck bichromatic plane matching of points

A. Biniaz, A. Maheshwari, M. Smid.

In Proceedings of the 26th Canadian Conference in Computational Geometry, (CCCG'14), pages 431-435, 2014.

Fixed-orientation equilateral triangle matching of point sets

J. Babu, A. Biniaz, A. Maheshwari, M. Smid.

In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM'13), Lecture Notes in Computer Science, Vol. 7748, Springer-Verlag, Berlin, pages 17-28, 2013.

Slope preserving terrain simplification - an experimental study

A. Biniaz.

In Proceedings of the 21th Canadian Conference on Computational Geometry (CCCG'09), pages 59-62, 2009.

Circumcircular range searching in higher order Delaunay triangulations

A. Biniaz.

In Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG'09), 2009.

Slope fidelity in terrains with higher order Delaunay triangulations

A. Biniaz, G. Dastghaibyfard.

In Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'08), pages 17-23, 2008.

Drainage reality in terrains with higher order Delaunay triangulations

A. Biniaz, G. Dastghaibyfard.

In Chapter 12 in: P. van Oosterom, S. Zlatanova, F. Penninga, and E. M. Fendel (eds.) Advances in3D Geoinformation Systems, LNG\&C (Lecture Notes in Geoinformation and Cartography), Springer Berlin Heidelberg, pages 199-211, 2008.

A comparison of plane sweep Delaunay triangulation algorithms

A. Biniaz, G. Dastghaibyfard.

In Proceedings of the 12th International Computer Society of Iran Computer Conference (CSICC'07), pages 1315-1320, 2007.

Thesis

Constrained higher order Delaunay triangulations

A. Biniaz.

Master’s thesis, Computer Engineering Department, Shiraz University, Shiraz, Iran, 2007.