We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows.
Given a set S of n geometric objects in the plane, we want to compute a maximum-size …

For a set of geometric objects, the associative geometric intersection graph is the graph with
a vertex for each object and an edge between two vertices if and only if the corresponding …