2 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani +1
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the…
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…
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…
On local structures of cubicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
A 2-stab unit interval graph (2SUIG) is an axes-parallel unit square intersection graph where the unit squares intersect either of the two fixed lines parallel to the -axis, dis…
On a special class of boxicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of interval graphs. A 2SIG is an axes-parallel rectan…