2 citations · 3 across the 5 of their papers we have counts for
18 papers
Improved approximation ratios for two Euclidean maximum spanning tree problems
Ahmad Biniaz
We study the following two maximization problems related to spanning trees in the Euclidean plane. It is not known whether or not these problems are NP-hard. We present approximati…
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
Ahmad Biniaz
Given a connected vertex-weighted graph , the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of that maximizes the total weight of internal…
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …
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…