Currently under review

  1. A short proof of the non-biplanarity of K9.

    A. Biniaz.

  2. Improved approximation ratios for two Euclidean maximum spanning tree problems.

    A. Biniaz.

  3. Simple linear time algorithms for piercing pairwise intersecting disks.

    A. Biniaz, P. Bose, and Y. Wang.

  4. Token Swapping on Trees

    A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A. Murty Naredla, J. Tkadlec, and A. Turcotte


 Journal Papers

  1. A short proof of the toughness of Delaunay triangulations

    A. Biniaz

    Journal of Computational Geometry, 12(1): 35–39, 2021.

  2. On the minimum consistent subset problem

    A. Biniaz, S. Cabello, A. Maheshwari, P. Carmi, S. Mehrabi, J.-L. De Carufel, M. Smid

    Accwpted to Algorithmica, 2021.

  3. Euclidean bottleneck bounded-degree spanning tree ratios

    A. Biniaz

    Accepted to Discrete & Computational Geometry, 2021.

  4. Faster algorithms for some optimization problems on collinear points

    A. Biniaz, P. Bose, P. Carmi, A. Maheshwari, I. Munro, and M.Smid

    Journal of Computational Geometry, 11(1): 418–432, 2020.

  5. Plane hop spanners for unit disk graphs: simpler and better

    A. Biniaz

    Computational Geometry: Theory and Applications, 89, 2020.

    Special issue of WADS 2019.

  6. Minimum ply covering of points with discs and squares

    T. Biedl, A. Biniaz, and A. Lubiw

    Computational Geometry: Theory and Applications, 94: 101712, 2021.

    Special issue of CCCG 2019.

  7. Plane and planarity thresholds for random geometric graphs

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

    Discrete Mathematics, Algorithms and Applications, 12(1): 2050005:1-2050005:21, 2020.

  8. Packing plane spanning trees into a point set

    A. Biniaz and A. García

    Accepted to Computational Geometry: Theory and Applications.

    Special issue of CCCG’18.

  9. Rollercoasters: long sequences without short runs

    T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, J. Shallit

    SIAM Journal on Discrete Mathematics, 33(2): 845–861, 2019.

  10. Packing boundary-anchored rectangles and squares

    T. Biedl, A. Biniaz, A. Maheshwari, and S. Mehrabi

    Computational Geometry: Theory and Applications, 88, 2020.

    Special issue of CCCG’17.

  11. Maximum plane trees in multipartite geometric graphs

    A. Biniaz, P. Bose, K. Crosbie, J.-L. De Carufel, D. Eppstein, A. Maheshwari, and M. Smid

    Algorithmica 81(4): 1512-1534, 2019.

  12. Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

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

    Information Processing Letters, 153:2020.

  13. Flip distance to some plane configurations

    A. Biniaz, A. Maheshwari, M. Smid

    Computational Geometry: Theory and Applications, 81: 12-21, 2019.

  14. Improved bounds for guarding plane graphs with edges

    A. Biniaz, P. Bose, A. Ooms, S. Verdonschot

    Graphs and Combinatorics, 35(2): 437-450, 2019.

  15. Spanning trees in multipartite geometric graphs

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

    Algorithmica, 80(11): 3177-3191, 2018.

  16. Plane bichromatic trees of low degree

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

    Discrete & Computational Geometry, 59(4): 864–885, 2018.

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

  18. Faster algorithms for the minimum red-blue-purple 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.

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

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

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

  22. A plane 1.88-spanner 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.

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

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

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

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

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

  26. Matchings in higher-order Gabriel graphs

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

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

  27. On the hardness of the full Steiner tree problems

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

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

  28. Approximating the bottleneck plane perfect matching of a point set

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

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

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

  30. Fixed-orientation equilateral triangle matching of point sets

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

    Theoretical Computer Science, 555: 55-70, 2014.

    Special issue of WALCOM'13.

  31. 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):377-380, 2014.


 Conference Papers

  1. Euclidean maximum matchings in the plane---local to global.

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

    Accepted to the 17th International Symposium on Algorithms and Data Structures (WADS), 2021.

  2. On the spanning and routing ratio of the directed Theta-six graph.

    H. Akitaya, A. Biniaz and P. Bose.

    Accepted to the 17th International Symposium on Algorithms and Data Structures (WADS), 2021.

    Also appeared in ICCG’21.

  3. The minimum moving spanning tree problem.

    H. Akitaya, A. Biniaz, P. Bose, J.-L. De Carufel, A. Maheshwari, L. F. Schultz Xavier da Silveira and M. Smid.

    Accepted to the 17th International Symposium on Algorithms and Data Structures (WADS), 2021.

    Also appeared in ICCG’21.

  4. Better approximation algorithms for the maximum weight internal spanning tree problem in cubic graphs and claw-free graphs.

    A. Biniaz

    In Proceedings of the 15th International Conference and Workshops on Algorithms and Computation (WALCOM), pages 260-271, 2021.

  5. Bounded-angle minimum spanning trees.

    A. Biniaz, P. Bose, , A. Lubiw, and A. Maheshwari

    In Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'20), pages 14:1-14:22, 2020.

  6. Euclidean bottleneck bounded-degree spanning tree ratios

    A. Biniaz

    In Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA'20), pages 826-836, 2020.

  7. A short proof of the toughness of Delaunay triangulations

    A. Biniaz

    In Proceedings of the 3rd ACM-SIAM Symposium on Simplicity in Algorithms (SOSA'20), pages 43-46, 2020.

  8. Minimum ply covering of points with convex shapes

    A. Biniaz and Z. Lin

    In the Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG'20), pages 2-5, 2020.

  9. Plane hop spanners for unit disk graphs

    A. Biniaz

    In Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS'19), pages 140–151, 2019.

  10. On the minimum consistent subset problem

    A. Biniaz, S. Cabello, A. Maheshwari, P. Carmi, S. Mehrabi, J.-L. De Carufel, and M. Smid

    In Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS'19), pages 155–167, 2019.

  11. Minimum ply covering of points with discs and squares

    T. Biedl, A. Biniaz, and A. Lubiw

    In Proceedings of the 31sth Canadian Conference in Computational Geometry (CCCG'19), pages 226–235, 2019.

  12. Three-coloring three-dimensional uniform hypergraphs

    A. Biniaz, P. Bose, J. Cardinal, and M. Payne

    In Proceedings of the 31sth Canadian Conference in Computational Geometry (CCCG'19), pages 23–28, 2019.

  13. Maximum matchings and minimum blocking sets in Theta-6 graphs

    T. Biedl, A. Biniaz, V. Irvine, K. Jain, P. Kindermann, and A. Lubiw

    In Proceedings of the the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'19), pages 258–270, 2019.

    Also appeared in EuroCG 2019.

  14. Rollercoasters and caterpillars

    T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, and J. Shallit

    In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP’18), 18:1-18:15, 2018.

    Also in the 34th European Workshop on Computational Geometry (EuroCG’18), under the name Rollercoasters: long sequences without short runs

  15. Improved bounds for guarding plane graphs with edges

    A. Biniaz, P. Bose, A. Ooms, and S. Verdonschot

    In Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 14:1-14:12, 2018.

  16. Flip distance to some plane configurations

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

    In Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 11:1-11:14, 2018.

  17. On the size of outer-string representations

    T. Biedl, A. Biniaz, and M. Derka

    In Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’18), 10:1-10:14, 2018.

  18. 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), 8:1-8:14, 2018.

  19. Packing plane spanning trees into a point set

    A. Biniaz and A. García

    In Proceedings of the 30th Canadian Conference in Computational Geometry (CCCG’18), 49-53, 2018.

  20. Compatible 4-holes in point sets

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

    In Proceedings of the 30th Canadian Conference in Computational Geometry (CCCG’18), 346-352, 2018.

  21. Integral unit bar-visibility graphs

    T. Biedl, A. Biniaz, V. Irvine, P. Kindermann, A. M. Naredla, A. Turcotte

    In Proceedings of the 30th Canadian Conference in Computational Geometry (CCCG’18), 230-246, 2018.

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

    In Proceedings of the 30th Canadian Conference in Computational Geometry (CCCG’18), 54-60, 2018.

  23. Packing boundary-anchored rectangles

    T. Biedl, A. Biniaz, A. Maheshwari, and S. Mehrabi

    In Proceedings of the 29th Canadian Conference on Computational Geometry (CCCG’17), 138-143, 2017.

  24. 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), 193-204, 2017.

  25. 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:1-19:14, 2016.

  26. 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, and M. Smid

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

  27. 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), 68-80, 2016.

  28. A plane 1.88-spanner 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:1-25:14, 2016.

  29. Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

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

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

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

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

  32. A faster 4-approximation 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.

  33. 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, Springer-Verlag, Berlin, pages 66–78, 2015.

  34. Higher-order triangular-distance Delaunay graphs: graph-theoretical 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.

  35. 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 113-117, 2014.

  36. 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 431-435, 2014.

  37. Fixed-orientation 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, Springer-Verlag, Berlin, pages 17-28, 2013.


 Thesis

  1. Matchings in geometric graphs

    A. Biniaz

    PhD thesis, School of Computer Science, Carleton University, 2016.

  2. Constrained higher order Delaunay triangulations

    A. Biniaz

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