Ahmad Biniaz

University of Windsor — Canada

Computer Science · Physical Sciences

8h-index321citations117works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(90), Advanced Graph Theory Research(46), Complexity and Algorithms in Graphs(18), Data Management and Algorithms(18), Optimization and Packing Problems(15)

Publications117 total

Noncrossing Longest Paths and Cycles
Graphs and Combinatorics·2025Open Access
City guarding with cameras of bounded field of view
Computational Geometry·2025
Minimum Plane Bichromatic Spanning Trees
ACM Transactions on Algorithms·2025
An Improved Bound for Plane Covering Paths
arXiv (Cornell University)·2025Open Access
Piercing unit geodesic disks
Computational Geometry·2025
On Separating Path and Tree Systems in Graphs
Discrete Mathematics & Theoretical Computer Science·2025· 1 citedOpen Access
Approximating average bounded-angle minimum spanning trees
Computational Geometry·2025
Polychromatic Coloring of Tuples in Hypergraphs
arXiv (Cornell University)·2025Open Access
Local Infection in Uniform Hypergraphs
SSRN Electronic Journal·2025Open Access
Local Infection in Uniform Hypergraphs
SSRN Electronic Journal·2025Open Access
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
arXiv (Cornell University)·2025Open Access
Contiguous Boundary Guarding
2024Open Access
Euclidean Maximum Matchings in the Plane—Local to Global
Algorithmica·2024
Minimum Plane Bichromatic Spanning Trees
arXiv (Cornell University)·2024Open Access
Euclidean Maximum Matchings in the Plane---Local to Global
arXiv (Cornell University)·2024Open Access
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
arXiv (Cornell University)·2024Open Access
The Minimum Consistent Spanning Subset Problem on Trees
Journal of Graph Algorithms and Applications·2024· 1 citedOpen Access
On Separating Path and Tree Systems in Graphs
arXiv (Cornell University)·2023· 1 citedOpen Access
Simple linear time algorithms for piercing pairwise intersecting disks
Computational Geometry·2023· 1 cited
Acute Tours in the Plane
Discrete & Computational Geometry·2023Open Access
page 1 of 6Next →

Frequent Co-authors

Anil Maheshwari(35), Michiel Smid(25), Prosenjit Bose(18), Michiel H. M. Smid(7), Jean-Lou De Carufel(6), Anna Lubiw(5), Thérèse Biedl(4), Jasine Babu(3), David Eppstein(3), Paul Liu(2), Gholamhossein Dastghaibyfard(2), K. Crosbie(2), Mahdi Amani(2), Cyril Gavoille(2), A. Karim Abu-Affash(1), Paz Carmi(1), Robert Cummings(1), Florín Manea(1), Dirk Nowotka(1), Jeffrey Shallit(1)