Ahmad Biniaz

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 112

Top Venues

Publications

Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR (2024)
Ahmad Biniaz, Parham Khamsepour
The Minimum Consistent Spanning Subset Problem on Trees. J. Graph Algorithms Appl. 28 (1) (2024)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR (2024)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27 (1) (2023)
Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
Piercing Unit Geodesic Disks. CCCG (2023)
Ahmad Biniaz
Improved Bounds for Covering Paths and Trees in the Plane. SoCG (2023)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
On Separating Path and Tree Systems in Graphs. CoRR (2023)
Ahmad Biniaz
Improved Bounds for Covering Paths and Trees in the Plane. CoRR (2023)
Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114 (2023)
Ahmad Biniaz, Mohammad Hashemi
City Guarding with Cameras of Bounded Field of View. CCCG (2023)
Ahmad Biniaz
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. J. Graph Algorithms Appl. 26 (2) (2022)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. Algorithmica 84 (1) (2022)
Ahmad Biniaz, Prosenjit Bose, Patrick Devaney
A 13/9-approximation of the average-2π/3-MST. CCCG (2022)
Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour
A 10-Approximation of the π/2-MST. STACS (2022)
Ahmad Biniaz
Acute Tours in the Plane. SoCG (2022)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
-graph. Comput. Geom. (2022)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1 (1) (2022)
Saman Bazargani, Ahmad Biniaz, Prosenjit Bose
Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN (2022)
Ahmad Biniaz
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. 67 (1) (2022)
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Ahmad Biniaz
A short proof of the non-biplanarity of $K_9$. J. Graph Algorithms Appl. 26 (1) (2022)
Ahmad Biniaz
Approximating Longest Spanning Tree with Neighborhoods. ISAAC (2021)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
On the Minimum Consistent Subset Problem. Algorithmica 83 (7) (2021)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. WADS (2021)
Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG (2021)
Ahmad Biniaz
A Short Proof of the Non-biplanarity of $$K_9$$. Graph Drawing (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR (2021)
Ahmad Biniaz
A short proof of the toughness of Delaunay triangulations. J. Comput. Geom. 12 (1) (2021)
Ahmad Biniaz
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. WALCOM (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. WADS (2021)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS (2021)
Ahmad Biniaz
Acute Tours in the Plane. CoRR (2021)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum ply covering of points with disks and squares. Comput. Geom. 94 (2021)
Ahmad Biniaz
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. SODA (2020)
Ahmad Biniaz, Alfredo García
Packing plane spanning trees into a point set. Comput. Geom. 90 (2020)
Ahmad Biniaz
Plane hop spanners for unit disk graphs: Simpler and better. Comput. Geom. 89 (2020)
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
Compatible Paths on Labelled Point Sets. CoRR (2020)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12 (1) (2020)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020)
Ahmad Biniaz
. CoRR (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
Ahmad Biniaz, Zhikai Lin
Minimum Ply Covering of Points with Convex Shapes. CCCG (2020)
Ahmad Biniaz
A Short Proof of the Toughness of Delaunay Triangulations. SOSA (2020)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. SWAT (2020)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing boundary-anchored rectangles and squares. Comput. Geom. 88 (2020)
Ahmad Biniaz
Improved approximation ratios for two Euclidean maximum spanning tree problems. CoRR (2020)
Ahmad Biniaz
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. CoRR (2020)
Ahmad Biniaz
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. CoRR (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip distance to some plane configurations. Comput. Geom. 81 (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. CoRR (2019)
Ahmad Biniaz
Plane Hop Spanners for Unit Disk Graphs: Simpler and Better. CoRR (2019)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81 (4) (2019)
Ahmad Biniaz
Plane Hop Spanners for Unit Disk Graphs. WADS (2019)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing Boundary-Anchored Rectangles and Squares. CoRR (2019)
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG (2019)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum Ply Covering of Points with Disks and Squares. CCCG (2019)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. WADS (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG (2019)
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
Token Swapping on Trees. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum Ply Covering of Points with Disks and Squares. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
-Graphs. CoRR (2019)
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. 35 (2) (2019)
Ahmad Biniaz
A Short Proof of the Toughness of Delaunay Triangulations. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33 (2) (2019)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters and Caterpillars. ICALP (2018)
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
Improved Bounds for Guarding Plane Graphs with Edges. SWAT (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. SWAT (2018)
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
Compatible Paths on Labelled Point Sets. CCCG (2018)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59 (4) (2018)
Ahmad Biniaz, Alfredo García
Packing Plane Spanning Trees into a Point Set. CCCG (2018)
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80 (11) (2018)
Therese C. Biedl, Ahmad Biniaz, Martin Derka
On the Size of Outer-String Representations. SWAT (2018)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters and Caterpillars. CoRR (2018)
Ahmad Biniaz, Alfredo García
Packing Plane Spanning Trees into a Point Set. CoRR (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR (2018)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR (2018)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte
Integral Unit Bar-Visibility Graphs. CCCG (2018)
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
Improved Bounds for Guarding Plane Graphs with Edges. CoRR (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Strong matching of points with geometric shapes. Comput. Geom. 68 (2018)
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. CoRR (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CCCG (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CoRR (2017)
Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60 (2017)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing Boundary-Anchored Rectangles. CCCG (2017)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. WADS (2017)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63 (2017)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards plane spanners of degree 3. J. Comput. Geom. 8 (1) (2017)
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21 (4) (2017)
Ahmad Biniaz
Matchings in Geometric Graphs. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
Spanning Trees in Multipartite Geometric Graphs. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57 (2016)
Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
A Plane 1.88-Spanner for Points in Convex Position. SWAT (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. ISAAC (2016)
Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7 (1) (2016)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. IWOCA (2016)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
On full Steiner trees in unit disk graphs. Comput. Geom. 48 (6) (2015)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS (2015)

Ahmad Biniaz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ahmad Biniaz