Search Results - "Ahmad Biniaz"

Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios by Biniaz, Ahmad

“…Inspired by the seminal works of Khuller et al. (SIAM J. Comput. 25 (2), 355–368 (1996)) and Chan (Discrete Comput. Geom. 32 (2), 177–194 (2004)) we study the…”
Get full text

Approximation algorithms for the unit disk cover problem in 2D and 3D by Biniaz, Ahmad, Liu, Paul, Maheshwari, Anil, Smid, Michiel

“…Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We…”
Get full text

Bounded-Angle Minimum Spanning Trees by Biniaz, Ahmad, Bose, Prosenjit, Lubiw, Anna, Maheshwari, Anil

“…Motivated by the connectivity problem in wireless networks with directional antennas, we study bounded-angle spanning trees. Let P be a set of points in the…”
Get full text

On the Minimum Consistent Subset Problem by Biniaz, Ahmad, Cabello, Sergio, Carmi, Paz, De Carufel, Jean-Lou, Maheshwari, Anil, Mehrabi, Saeed, Smid, Michiel

“…Let P be a set of n colored points in the d -dimensional Euclidean space. Introduced by Hart (1968), a consistent subset of P , is a set S ⊆ P such that for…”
Get full text

Token Swapping on Trees by Biniaz, Ahmad, Jain, Kshitij, Lubiw, Anna, Masárová, Zuzana, Miltzow, Tillmann, Mondal, Debajyoti, Naredla, Anurag Murty, Tkadlec, Josef, Turcotte, Alexi

“…The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The…”
Get full text

Acute Tours in the Plane by Biniaz, Ahmad

“…We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number  n , every set of n points in the plane can be…”
Get full text

Packing Plane Perfect Matchings into a Point Set by Biniaz, Ahmad, Bose, Prosenjit, Maheshwari, Anil, Smid, Michiel

“…Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For…”
Get full text

A plane 1.88-spanner for points in convex position by Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel Smid, Prosenjit Bose, Jean-Lou De Carufel

“…Let $S$ be a set of $n$ points in the plane that is in convex position. For a real number $t>1$, we say that a point $p$ in $S$ is $t$-good if for every point…”
Get full text

Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs by Biniaz, Ahmad

“…Given a connected vertex-weighted graph $G$, the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of $G$ that maximizes the…”
Get full text

A short proof of the non-biplanarity of $K_9 by Biniaz, Ahmad

“…Battle, Harary, and Kodama (1962) and independently Tutte (1963) proved that the complete graph with nine vertices is not biplanar. Aiming towards simplicity…”
Get full text

The Minimum Consistent Spanning Subset Problem on Trees by Biniaz, Ahmad, Khamsepour, Parham

Get full text

Euclidean Maximum Matchings in the Plane—Local to Global by Biniaz, Ahmad, Maheshwari, Anil, Smid, Michiel

Get full text

Simple linear time algorithms for piercing pairwise intersecting disks by Biniaz, Ahmad, Bose, Prosenjit, Wang, Yunkai

“…A set D of disks in the plane is said to be pierced by a point set P if each disk in D contains a point of P. Any set of pairwise intersecting unit disks can…”
Get full text

On the spanning and routing ratios of the directed Θ6-graph by Akitaya, Hugo A., Biniaz, Ahmad, Bose, Prosenjit

“…The family of Θk-graphs is an important class of sparse geometric spanners with a small spanning ratio. Although they are a well-studied class of geometric…”
Get full text

Minimum ply covering of points with disks and squares by Biedl, Therese, Biniaz, Ahmad, Lubiw, Anna

“…Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set P of points and a set S of…”
Get full text

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs by Biniaz, Ahmad, Maheshwari, Anil, Smid, Michiel

“…Given a set P of n points in the plane, the order-k Gabriel graph on P, denoted by k-GG, has an edge between two points p and q if and only if the closed disk…”
Get full text

Matchings in higher-order Gabriel graphs by Biniaz, Ahmad, Maheshwari, Anil, Smid, Michiel

“…Given a set P of n points in the plane, the order-k Gabriel graph on P, denoted by k-GG, has an edge between two points p and q if and only if the closed disk…”
Get full text

A faster circle-sweep Delaunay triangulation algorithm by Biniaz, Ahmad, Dastghaibyfard, Gholamhossein

“…► We presented a sweep-circle algorithm to compute the Delaunay triangulation (DT). ► The circle sweeps the plane and forms new triangles by recursive…”
Get full text

Plane Bichromatic Trees of Low Degree by Biniaz, Ahmad, Bose, Prosenjit, Maheshwari, Anil, Smid, Michiel

“…Let R and B be two disjoint sets of points in the plane such that | B | ≤ | R | , and no three points of R ∪ B are collinear. We show that the geometric…”
Get full text

Spanning Trees in Multipartite Geometric Graphs by Biniaz, Ahmad, Bose, Prosenjit, Eppstein, David, Maheshwari, Anil, Morin, Pat, Smid, Michiel

“…Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = | R ∪ B | . A…”
Get full text