20 citations · 66 across the 52 of their papers we have counts for
Showing 2025 · cs.CGShow all
3 papers · 2 filters
cs.CG2025
An Improved Bound for Plane Covering Paths
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8
A covering path for a finite set of points in the plane is a polygonal path such that every point of lies on a segment of the path. The vertices of the path need not be at…
cs.CG2025
Polychromatic Coloring of Tuples in Hypergraphs
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +3
A hypergraph consists of a set of vertices and a set of hyperedges that are subsets of . A -tuple of is a subset of vertices of . A -tuple -color…
cs.CG2025
Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung +6
Let be a set of points in , where is a constant, and let be a sequence of vertical hyperplanes that are sorted by their fi…