S. Bhore

activity

20162026

most citedEvent Driven CBBA with Reduced Communication

5 citations · 7 across the 31 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

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.DS2019

Parameterized Algorithms for Book Embedding Problems

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1

A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page c…

cs.CG2019

Algorithm and Hardness results on Liar's Dominating Set and $k$ -tuple Dominating Set

Sandip Banerjee, Sujoy Bhore

Given a graph $G = (V, E)$ , the dominating set problem asks for a minimum subset of vertices $D \subseteq V$ such that every vertex $u \in V ∖ D$ is adjacent to at least one vert…

Balanced Connected Subgraph Problem in Geometric Intersection Graphs

Parameterized Algorithms for Book Embedding Problems

Algorithm and Hardness results on Liar's Dominating Set and k-tuple Dominating Set

Algorithm and Hardness results on Liar's Dominating Set and $k$ -tuple Dominating Set