Slope Preserving Terrain Simplification - An Experimental Study. - Ahmad Biniaz (CCCG, 2009)

A faster circle-sweep Delaunay triangulation algorithm. - Ahmad Biniaz; Gholamhossein Dastghaibyfard (Adv. Eng. Softw., 2012)

Approximating the Bottleneck Plane Perfect Matching of a Point Set. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CoRR, 2013)

Approximating Full Steiner Tree in a Unit Disk Graph. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Bottleneck Bichromatic Plane Matching of Points. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2014)

Matching in Gabriel Graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CoRR, 2014)

Fixed-orientation equilateral triangle matching of point sets. - Jasine Babu; Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2014)

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid; Paul Liu 001 (CCCG, 2015)

Approximating the bottleneck plane perfect matching of a point set. - A. Karim Abu-Affash; Ahmad Biniaz; Paz Carmi; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

On full Steiner trees in unit disk graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Packing Plane Perfect Matchings into a Point Set. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Math. Theor. Comput. Sci., 2015)

On the hardness of full Steiner tree problems. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (J. Discrete Algorithms, 2015)

Matchings in higher-order Gabriel graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2015)

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2016)

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Matchings in Geometric Graphs. - Ahmad Biniaz (CoRR, 2016)

A plane 1.88-spanner for points in convex position. - Ahmad Biniaz; Mahdi Amani; Anil Maheshwari; Michiel H. M. Smid; Prosenjit Bose; Jean-Lou De Carufel (J. Comput. Geom., 2016)

Packing Boundary-Anchored Rectangles. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (CCCG, 2017)

Approximation algorithms for the unit disk cover problem in 2D and 3D. - Ahmad Biniaz; Paul Liu 001; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2017)

An optimal algorithm for plane matchings in multipartite geometric graphs. - Ahmad Biniaz; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (Comput. Geom., 2017)

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Towards plane spanners of degree 3. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; Anil Maheshwari; Michiel H. M. Smid (J. Comput. Geom., 2017)

Compatible Paths on Labelled Point Sets. - Elena Arseneva; Yeganeh Bahoo; Ahmad Biniaz; Pilar Cano; Farah Chanchary; John Iacono; Kshitij Jain 001; Anna Lubiw; Debajyoti Mondal; Khadijeh Sheikhan; Csaba D. Tóth (CCCG, 2018)

Integral Unit Bar-Visibility Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Philipp Kindermann; Anurag Murty Naredla; Alexi Turcotte (CCCG, 2018)

Compatible 4-Holes in Point Sets. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2018)

Rollercoasters and Caterpillars. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (ICALP, 2018)

On the Size of Outer-String Representations. - Therese Biedl; Ahmad Biniaz; Martin Derka (SWAT, 2018)

Spanning Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; David Eppstein; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (Algorithmica, 2018)

Strong matching of points with geometric shapes. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2018)

Plane Bichromatic Trees of Low Degree. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Comput. Geom., 2018)

Three-Coloring Three-Dimensional Uniform Hypergraphs. - Ahmad Biniaz; Prosenjit Bose; Jean Cardinal; Michael S. Payne (CCCG, 2019)

Plane Hop Spanners for Unit Disk Graphs. - Ahmad Biniaz (WADS, 2019)

Maximum Matchings and Minimum Blocking Sets in varTheta _6 -Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (WG, 2019)

Maximum Plane Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; Kimberly Crosbie; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2019)

Flip distance to some plane configurations. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2019)

Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (CoRR, 2019)

Improved Bounds for Guarding Plane Graphs with Edges. - Ahmad Biniaz; Prosenjit Bose; Aurélien Ooms; Sander Verdonschot (Graphs Comb., 2019)

Rollercoasters: Long Sequences without Short Runs. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (SIAM J. Discret. Math., 2019)

Minimum Ply Covering of Points with Convex Shapes. - Ahmad Biniaz; Zhikai Lin (CCCG, 2020)

Packing boundary-anchored rectangles and squares. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (Comput. Geom., 2020)

Plane hop spanners for unit disk graphs: Simpler and better. - Ahmad Biniaz (Comput. Geom., 2020)

Packing plane spanning trees into a point set. - Ahmad Biniaz; Alfredo García 002 (Comput. Geom., 2020)

Improved approximation ratios for two Euclidean maximum spanning tree problems. - Ahmad Biniaz (CoRR, 2020)

Plane and planarity thresholds for random geometric graphs. - Ahmad Biniaz; Evangelos Kranakis; Anil Maheshwari; Michiel H. M. Smid (Discret. Math. Algorithms Appl., 2020)

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Inf. Process. Lett., 2020)

Faster algorithms for some optimization problems on collinear points. - Ahmad Biniaz; Prosenjit Bose; Paz Carmi; Anil Maheshwari; J. Ian Munro; Michiel H. M. Smid (J. Comput. Geom., 2020)

A Short Proof of the Non-biplanarity of $$K_9$$. - Ahmad Biniaz (GD, 2021)

On the Spanning and Routing Ratios of the Directed $ varTheta _6$-Graph. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose (WADS, 2021)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel Smid (Algorithmica, 2021)

Minimum ply covering of points with disks and squares. - Therese Biedl; Ahmad Biniaz; Anna Lubiw (Comput. Geom., 2021)

A short proof of the toughness of Delaunay triangulations. - Ahmad Biniaz (J. Comput. Geom., 2021)

A 13/9-approximation of the average-2π/3-MST. - Ahmad Biniaz; Prosenjit Bose; Patrick Devaney (CCCG, 2022)

Piercing Pairwise Intersecting Convex Shapes in the Plane. - Saman Bazargani; Ahmad Biniaz; Prosenjit Bose (LATIN, 2022)

Bounded-Angle Minimum Spanning Trees. - Ahmad Biniaz; Prosenjit Bose; Anna Lubiw; Anil Maheshwari (Algorithmica, 2022)

Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. - Ahmad Biniaz; Anil Maheshwari; Michiel Smid (Comput. Geom. Topol., 2022)

On the spanning and routing ratios of the directed Θ6-graph. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose (Comput. Geom., 2022)

Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. - Ahmad Biniaz (Discret. Comput. Geom., 2022)

Token Swapping on Trees. - Ahmad Biniaz; Kshitij Jain 001; Anna Lubiw; Zuzana Masárová; Tillmann Miltzow; Debajyoti Mondal; Anurag Murty Naredla; Josef Tkadlec; Alexi Turcotte (Discret. Math. Theor. Comput. Sci., 2022)

A short proof of the non-biplanarity of K9. - Ahmad Biniaz (J. Graph Algorithms Appl., 2022)

Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. - Ahmad Biniaz (J. Graph Algorithms Appl., 2022)

City Guarding with Cameras of Bounded Field of View. - Ahmad Biniaz; Mohammad Hashemi (CCCG, 2023)

The Minimum Moving Spanning Tree Problem. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luís Fernando Schultz Xavier da Silveira; Michiel Smid (J. Graph Algorithms Appl., 2023)

Approximating longest spanning tree with neighborhoods. - Ahmad Biniaz (J. Comput. Geom., 2023)

A 10-Approximation of the π/2 -MST. - Ahmad Biniaz; Majid Daliri; Amir Hossein Moradpour (J. Comput. Geom., 2023)

Simple linear time algorithms for piercing pairwise intersecting disks. - Ahmad Biniaz; Prosenjit Bose; Yunkai Wang (Comput. Geom., 2023)

Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof. - Ahmad Biniaz (ESA, 2024)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

Minimum Plane Bichromatic Spanning Trees. - Hugo A. Akitaya; Ahmad Biniaz; Erik D. Demaine; Linda Kleist; Frederick Stock; Csaba D. Tóth (ISAAC, 2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid (CoRR, 2024)

Contiguous Boundary Guarding. - Ahmad Biniaz; Anil Maheshwari; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Thomas C. Shermer (CoRR, 2024)

The Minimum Consistent Spanning Subset Problem on Trees. - Ahmad Biniaz; Parham Khamsepour (J. Graph Algorithms Appl., 2024)

Improved bounds for covering paths and trees in the plane. - Ahmad Biniaz (J. Comput. Geom., 2024)

Acute Tours in the Plane. - Ahmad Biniaz (Discret. Comput. Geom., 2024)

Polychromatic Coloring of Tuples in Hypergraphs. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid; Shakhar Smorodinsky; Milos Stojakovic (SoCG, 2025)

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. - Ahmad Biniaz; Anil Maheshwari; Magnus Christian Ring Merrild; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Eliot W. Robson; Casper Moldrup Rysgaard; Jens Kristian Refsgaard Schou; Thomas C. Shermer; Jack Spalding-Jamieson; Rolf Svenning; et al. (SoCG, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

Approximating average bounded-angle minimum spanning trees. - Ahmad Biniaz; Prosenjit Bose; Patrick Devaney (Comput. Geom., 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

Euclidean Maximum Matchings in the Plane - Local to Global. - Ahmad Biniaz; Anil Maheshwari; Michiel Smid (Algorithmica, 2025)

An Improved Bound for Plane Covering Paths. - Hugo A. Akitaya; Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; John Iacono; Linda Kleist; Michiel Smid; Diane L. Souvaine; Leonidas Theocharous (CoRR, 2025)

Piercing unit geodesic disks. - Ahmad Biniaz; Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2026)