| 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 | 51 | 2017 |
| A faster circle-sweep Delaunay triangulation algorithm A Biniaz, G Dastghaibyfard Advances in Engineering Software 43 (1), 1-13, 2012 | 37 | 2012 |
| Token swapping on trees A Biniaz, K Jain, A Lubiw, Z Masárová, T Miltzow, D Mondal, AM Naredla, ... Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2023 | 17 | 2023 |
| On the minimum consistent subset problem A Biniaz, S Cabello, P Carmi, JL De Carufel, A Maheshwari, S Mehrabi, ... Algorithmica 83, 2273-2302, 2021 | 17 | 2021 |
| 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 | 17 | 2015 |
| 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 | 16 | 2016 |
| A plane 1.88-spanner for points in convex position A Biniaz, M Amani, A Maheshwari, M Smid, P Bose, JL De Carufel Journal of Computational Geometry 7 (1), 520–539-520–539, 2016 | 15 | 2016 |
| Bottleneck Bichromatic Plane Matching of Points. A Biniaz, A Maheshwari, MHM Smid CCCG, 2014 | 15 | 2014 |
| Minimum ply covering of points with disks and squares T Biedl, A Biniaz, A Lubiw Computational Geometry 94, 101712, 2021 | 13 | 2021 |
| Plane hop spanners for unit disk graphs: Simpler and better A Biniaz Computational Geometry 89, 101622, 2020 | 13 | 2020 |
| Packing plane spanning trees into a point set A Biniaz, A García Computational Geometry 90, 101653, 2020 | 12 | 2020 |
| Spanning trees in multipartite geometric graphs A Biniaz, P Bose, D Eppstein, A Maheshwari, P Morin, M Smid Algorithmica 80, 3177-3191, 2018 | 12 | 2018 |
| Fixed-orientation equilateral triangle matching of point sets J Babu, A Biniaz, A Maheshwari, M Smid Theoretical Computer Science 555, 55-70, 2014 | 12 | 2014 |
| Plane bichromatic trees of low degree A Biniaz, P Bose, A Maheshwari, M Smid Discrete & Computational Geometry 59, 864-885, 2018 | 11 | 2018 |
| Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties A Biniaz, A Maheshwari, M Smid Computational Geometry 48 (9), 646-660, 2015 | 11 | 2015 |
| On the hardness of full Steiner tree problems A Biniaz, A Maheshwari, M Smid Journal of Discrete Algorithms 34, 118-127, 2015 | 11 | 2015 |
| Slope fidelity in terrains with higher-order Delaunay triangulations A Biniaz, G Dastghaibyfard Václav Skala-UNION Agency, 2008 | 11 | 2008 |
| Euclidean bottleneck bounded-degree spanning tree ratios A Biniaz Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 10 | 2020 |
| Flip distance to some plane configurations A Biniaz, A Maheshwari, M Smid Computational Geometry 81, 12-21, 2019 | 10 | 2019 |
| 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 | 2019 |
Anil MaheshwariCarleton UniversityVerified email at scs.carleton.ca
