4 citations · 4 across the 10 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CG2019
Linear Size Planar Manhattan Network for Convex Point Sets
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Let be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge is its length. Let denote the len…
cs.DM2019
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…
cs.DM2019
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…