40 citations · 98 across the 42 of their papers we have counts for
3 papers · 1 filter
Maximum Bipartite Subgraph of Geometric Intersection Graphs
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi +1
We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows. Given a set of geometric objects in the plane, we want to compute a maximum-size subset…
Plane and Planarity Thresholds for Random Geometric Graphs
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari +1
A random geometric graph, , is formed by choosing points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if the…
Improved Methods For Generating Quasi-Gray Codes
Dana Jansens, Prosenjit Bose, Paz Carmi +3
Consider a sequence of bit strings of length d, such that each string differs from the next in a constant number of bits. We call this sequence a quasi-Gray code. We examine the pr…