
Linear Size Planar Manhattan Network for Convex Point Sets
Let G = (V, E) be an edgeweighted geometric graph such that every edge ...
read it

Maximum Bipartite Subgraph of Geometric Intersection Graphs
We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
read it

Balanced Connected Subgraph Problem in Geometric Intersection Graphs
We study the Balanced Connected Subgraph(shortly, BCS) problem on geomet...
read it

The Balanced Connected Subgraph Problem
The problem of computing induced subgraphs that satisfy some specified r...
read it

Covering and Packing of Rectilinear Subdivision
We study a class of geometric covering and packing problems for bounded ...
read it
Satyabrata Jana
is this you? claim profile