Ahmad Biniaz

activity

20242026

collaborators

9 papers

cs.CG2026

Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers

Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung +6

Let $S$ be a set of $n$ points in $R^{d}$ , where $d \geq 2$ is a constant, and let $H_{1}, H_{2}, \dots, H_{m + 1}$ be a sequence of vertical hyperplanes that are sorted by their fi…

cs.CG2025

Noncrossing Longest Paths and Cycles

Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7

Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…

cs.CG2025

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults

Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +1

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$ . We say that $G$ is an $f$ -fault-tolerant $t$ -spanner for $H$ , if the following is true for any subset $F$ of at…

cs.CG2025

An Improved Bound for Plane Covering Paths

Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at…

cs.DM2025

On Separating Path and Tree Systems in Graphs

Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +6

We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct element…

cs.CG2025

Contiguous Boundary Guarding

Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell +3

We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we presen…