4 citations · 5 across the 5 of their papers we have counts for
5 papers
Spanning Trees in Multipartite Geometric Graphs
Ahmad Biniaz, Prosenjit Bose, David Eppstein +3
Let and be two disjoint sets of points in the plane where the points of are colored red and the points of are colored blue, and let . A bichromatic spa…
Matchings in Geometric Graphs
Ahmad Biniaz
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the…
Packing Plane Perfect Matchings into a Point Set
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari +1
Given a set of points in the plane, where is even, we consider the following question: How many plane perfect matchings can be packed into ? We prove that at least $…
Matching in Gabriel Graphs
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Given a set of points in the plane, the order- Gabriel graph on , denoted by -, has an edge between two points and if and only if the closed disk with…
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set of points in the plane. In TD-Delaunay, the convex distance is defined by a fixed-ori…