5 citations · 7 across the 33 of their papers we have counts for
7 papers · 1 filter
Light Euclidean Steiner Spanners in the Plane
Sujoy Bhore, Csaba D. Tóth
Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb{…
On Euclidean Steiner -Spanners
Sujoy Bhore, Csaba D. Tóth
Lightness and sparsity are two natural parameters for Euclidean -spanners. Classical results show that, when the dimension and ar…
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…