Currently under review

Rollercoasters: long sequences without short runs
T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, J. Shallit
Submitted to SIAM Journal on Discrete Mathematics.

Packing plane spanning trees into a point set
A. Biniaz and A. García
Submitted to Computational Geometry: Theory and Applications.
Special issue of CCCG’18.

Plane and planarity thresholds for random geometric graphs
A. Biniaz, E. Kranakis, A. Maheshwari, and M. Smid
Submitted to Discrete Mathematics and Theoretical Computer Science.

Improved bounds for guarding plane graphs with edges
A. Biniaz, P. Bose, A. Ooms, S. Verdonschot
Submitted to Graphs and Combinatorics.

Faster algorithms for some optimization problems on collinear points
A. Biniaz, P. Bose, P. Carmi, A. Maheshwari, I. Munro, and M.Smid
Submitted to Journal of Computational Geometry.

On the minimum consistent subset problem
A. Biniaz, S. Cabello, A. Maheshwari, P. Carmi, S. Mehrabi, J.L. De Carufel, M. Smid

Continuous minimum membership covering
T. Biedl, A. Biniaz, and A. Lubiw

Plane hop spanners for unit disk graphs
A. Biniaz
Journal Papers

Maximum plane trees in multipartite geometric graphs
A. Biniaz, P. Bose, K. Crosbie, J.L. De Carufel, D. Eppstein, A. Maheshwari, and M. Smid
To appear in Algorithmica, DOI 10.1007/s004530180482x.

Flip distance to some plane configurations
A. Biniaz, A. Maheshwari, and M. Smid
To appear in Computational Geometry: Theory and Applications.

Packing boundaryanchored rectangles and squares
T. Biedl, A. Biniaz, A. Maheshwari, and S. Mehrabi
Submitted to Computational Geometry: Theory and Applications.
Special issue of CCCG’17.

Spanning trees in multipartite geometric graphs
A. Biniaz, P. Bose, D. Eppstein, A. Maheshwari, P. Morin, and M. Smid
To appear in Algorithmica, DOI 10.1007/s0045301703754.

Plane bichromatic trees of low degree
A. Biniaz, P. Bose, A. Maheshwari, and M. Smid
Discrete & Computational Geometry, 59(4): 864–885, 2018.

Strong matching of points with geometric shapes
A. Biniaz, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 68: 186–205, 2018.
Special issue in memory of Dr. Ferran Hurtado.

Faster algorithms for the minimum redbluepurple spanning graph problem
A. Biniaz, P. Bose, I. van Duijn, A. Maheshwari, and M. Smid
Journal of Graph Algorithms and Applications, 21(4): 527–546, 2017.

Towards plane spanners of degree 3
A. Biniaz, P. Bose, J.L. De Carufel, C. Gavoille, A. Maheshwari, and M. Smid
Journal of Computational Geometry, 8(1): 11–31, 2017.

An optimal algorithm for plane matchings in multipartite geometric graphs
A. Biniaz, A. Maheshwari, S. C. Nandy, and M. Smid
Computational Geometry: Theory and Applications, 63: 1–9, 2017.

Approximation algorithms for the unit disk cover problem in 2D and 3D
A. Biniaz, P. Liu, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 60: 8–18, 2017.
Special issue of CCCG'15.

A plane 1.88spanner for points in convex position
M. Amani, A. Biniaz, P. Bose, J.L. De Carufel, A. Maheshwari, and M. Smid
Journal of Computational Geometry, 7(1): 520–539, 2016.

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
A. Biniaz, P. Bose, A. Maheshwari, and 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, and M. Smid
Discrete Mathematics and Theoretical Computer Science, 17(2): 119–142, 2015.

Higherorder triangulardistance Delaunay graphs: graphtheoretical properties
A. Biniaz, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 48(9): 646–660, 2015.

Matchings in higherorder Gabriel graphs
A. Biniaz, A. Maheshwari, and M. Smid
Theoretical Computer Science, 596: 67–78, 2015.

On the hardness of the full Steiner tree problems
A. Biniaz, A. Maheshwari, and M. Smid
Journal of Discrete Algorithms, 34: 118–127, 2015.

Approximating the bottleneck plane perfect matching of a point set
K. AbuAffash, A. Biniaz, P. Carmi, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 48(9): 718–731, 2015.

On full Steiner trees in unit disk graphs
A. Biniaz, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 48(6): 453–458, 2015.

Fixedorientation equilateral triangle matching of point sets
J. Babu, A. Biniaz, A. Maheshwari, and M. Smid
Theoretical Computer Science, 555: 5570, 2014.
Special issue of WALCOM'13.

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
A. Biniaz, A. Maheshwari, and M. Smid
Computational Geometry: Theory and Applications, 47(3):377380, 2014.

A faster circlesweep Delaunay triangulation algorithm
A. Biniaz and G. Dastghaibyfard
Advances in Engineering Software, 43(1):113, 2012.
Conference Papers

Rollercoasters and caterpillars
T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, and J. Shallit
In The 45th International Colloquium on Automata, Languages, and Programming (ICALP’18), 2018.

Improved bounds for guarding plane graphs with edges
A. Biniaz, P. Bose, A. Ooms, and S. Verdonschot
In The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 2018.

Flip distance to some plane configurations
A. Biniaz, A. Maheshwari, and M. Smid
In The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 2018.

On the size of outerstring representations
T. Biedl, A. Biniaz, and M. Derka
In The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 2018.

Faster algorithms for some optimization problems on collinear points
A. Biniaz, P. Bose, P. Carmi, A. Maheshwari, I. Munro, and M.Smid
In Proceedings of the 34th International Symposium on Computational Geometry (SoCG’18), 2018.

Packing plane spanning trees into a point set
A. Biniaz and A. García
30th Canadian Conference in Computational Geometry (CCCG’18), 2018.

Compatible 4holes in point sets
A. Biniaz, A. Maheshwari, and M. Smid
30th Canadian Conference in Computational Geometry (CCCG’18), 2018.

Integral unit barvisibility graphs
T. Biedl, A. Biniaz, V. Irvine, P. Kindermann, A. M. Naredla, A. Turcotte
30th Canadian Conference in Computational Geometry (CCCG’18), 2018.

Compatible paths on labelled point sets
Y. Bahoo, A. Biniaz, P. Cano, F. Chanchary, J. Iacono, K. Jain, E. Khramtcova, A. Lubiw, D. Mondal, K. Sheikhan, C. D. Tóth
30th Canadian Conference in Computational Geometry (CCCG’18), 2018.

Rollercoasters: long sequences without short runs
T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, and J. Shallit
In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), 2018.

Packing boundaryanchored rectangles
T. Biedl, A. Biniaz, A. Maheshwari, and S. Mehrabi
In Proceedings of the 29th Canadian Conference on Computational Geometry (CCCG’17), 138143, 2017.

Maximum plane trees in multipartite geometric graphs
A. Biniaz, P. Bose, K. Crosbie, J.L. De Carufel, D. Eppstein, A. Maheshwari, and M. Smid
In Proceedings of the 15th International Symposium on Algorithms and Data Structures (WADS’17), 193204, 2017.

Towards plane spanners of degree 3
A. Biniaz, P. Bose, A Maheshwari, J.L. De Carufel, C. Gavoille, and M. Smid
In Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC’16), 19:119:14, 2016.

A faster algorithm for the minimum redbluepurple spanning graph problem for points on a circle
A. Biniaz, P. Bose, I. van Duijn, A. Maheshwari, and M. Smid
In Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG’16), 140146, 2016.

Plane bichromatic trees of low degree
A. Biniaz, P. Bose, A. Maheshwari, and M. Smid
In Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA’16), 6880, 2016.

A plane 1.88spanner for points in convex position
M. Amani, A. Biniaz, P. Bose, J.L. De Carufel, A. Maheshwari, and M. Smid
In Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’16), 25:125:14, 2016.

Bottleneck matchings and Hamiltonian cycles in higherorder Gabriel graphs
A. Biniaz, A. Maheshwari, and M. Smid
In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), 179182, 2016.

Plane and planarity thresholds for random geometric graphs
A. Biniaz, E. Kranakis, A. Maheshwari, and 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, and 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 4approximation algorithm for the unit disk cover problem
A. Biniaz, P. Liu, A. Maheshwari, and 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, and M. Smid.
In Proceedings of the 14th Algorithms and Data Structures Symposium (WADS’15), Lecture Notes in Computer Science, Vol. 9214, SpringerVerlag, Berlin, pages 66–78, 2015.

Higherorder triangulardistance Delaunay graphs: graphtheoretical properties
A. Biniaz, A. Maheshwari, and 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, and M. Smid
In Proceedings of the 26th Canadian Conference in Computational Geometry (CCCG'14), pages 113117, 2014.

Bottleneck bichromatic plane matching of points
A. Biniaz, A. Maheshwari, and M. Smid
In Proceedings of the 26th Canadian Conference in Computational Geometry, (CCCG'14), pages 431435, 2014.

Fixedorientation equilateral triangle matching of point sets
J. Babu, A. Biniaz, A. Maheshwari, and M. Smid
In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM'13), Lecture Notes in Computer Science, Vol. 7748, SpringerVerlag, Berlin, pages 1728, 2013.

Slope preserving terrain simplification  an experimental study
A. Biniaz
In Proceedings of the 21th Canadian Conference on Computational Geometry (CCCG'09), pages 5962, 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 and G. Dastghaibyfard
In Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'08), pages 1723, 2008.

Drainage reality in terrains with higher order Delaunay triangulations
A. Biniaz and 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 199211, 2008.

A comparison of plane sweep Delaunay triangulation algorithms
A. Biniaz and G. Dastghaibyfard
In Proceedings of the 12th International Computer Society of Iran Computer Conference (CSICC'07), pages 13151320, 2007.
Thesis

Matchings in geometric graphs
A. Biniaz
PhD thesis, School of Computer Science, Carleton University, 2016.

Constrained higher order Delaunay triangulations
A. Biniaz
Master’s thesis, Computer Engineering Department, Shiraz University, 2007.