10 papers
Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1
An -queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, such that no two independent edges of the same queue nes…
Dynamic Geometric Independent Set
Sujoy Bhore, Jean Cardinal, John Iacono +1
We present fully dynamic approximation algorithms for the Maximum Independent Set problem on several types of geometric objects: intervals on the real line, arbitrary axis-aligned…
Parameterized Study of Steiner Tree on Unit Disk Graphs
Sujoy Bhore, Paz Carmi, Sudeshna Kolay +1
We study the Steiner Tree problem on unit disk graphs. Given a vertex unit disk graph , a subset of vertices and a positive integer , the objective…
Planar Bichromatic Bottleneck Spanning Trees
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi +1
Given a set of red and blue points in the plane, a \emph{planar bichromatic spanning tree} of is a spanning tree of , such that each edge connects between a red and…
Geometric Systems of Unbiased Representatives
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore +1
Let be a set of points in , a bicoloring of and $\Oo$ a family of geometric objects (that is, intervals, boxes, balls, etc). An object from $\Oo$ is calle…
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…