11 citations · 35 across the 18 of their papers we have counts for
3 papers · 1 filter
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
Sujoy Bhore, Satyabrata Jana, Supantha Pandit +1
We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Gi…
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…
The Balanced Connected Subgraph Problem
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana +3
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we…