8 citations · 24 across the 27 of their papers we have counts for
8 papers · 1 filter
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Ahmad Biniaz
Inspired by the seminal works of Khuller et al. (STOC 1994) and Chan (SoCG 2003) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck…
A Short Proof of the Toughness of Delaunay Triangulations
Ahmad Biniaz
We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-…
Packing Boundary-Anchored Rectangles and Squares
Therese Biedl, Ahmad Biniaz, Anil Maheshwari +1
Consider a set of points on the boundary of an axis-aligned square . We study the boundary-anchored packing problem on in which the goal is to find a set of interior…
Flip Distance to some Plane Configurations
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
We study an old geometric optimization problem in the plane. Given a perfect matching on a set of points in the plane, we can transform it to a non-crossing perfect matchin…
Minimum Ply Covering of Points with Disks and Squares
Therese Biedl, Ahmad Biniaz, Anna Lubiw
Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set of points and a set of geometric objects, bo…
Token Swapping on Trees
Ahmad Biniaz, Kshitij Jain, Anna Lubiw +6
The input to the token swapping problem is a graph with vertices , and tokens with labels , one on each vertex. The goal is to get token…
Plane Hop Spanners for Unit Disk Graphs: Simpler and Better
Ahmad Biniaz
The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge b…
Maximum Matchings and Minimum Blocking Sets in -Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine +3
-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilatera…