8 citations · 24 across the 27 of their papers we have counts for
5 papers · 2 filters
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi +4
Let be a set of colored points in the plane. Introduced by Hart (1968), a consistent subset of , is a set such that for every point in ,…
Improved Bounds for Guarding Plane Graphs with Edges
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1
An "edge guard set" of a plane graph is a subset of edges of such that each face of is incident to an endpoint of an edge in . Such a set is said to guard . W…
Packing Plane Spanning Trees into a Point Set
Ahmad Biniaz, Alfredo García
Let be a set of points in the plane in general position. We show that at least plane spanning trees can be packed into the complete geometric graph on…
Faster Algorithms for some Optimization Problems on Collinear Points
Ahmad Biniaz, Prosenjit Bose, Paz Carmi +3
We propose faster algorithms for the following three optimization problems on collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in…
Rollercoasters and Caterpillars
Therese Biedl, Ahmad Biniaz, Robert Cummings +4
A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this seque…