
Online Euclidean Spanners
In this paper, we study the online Euclidean spanners problem for points...
read it

Dynamic Schnyder Woods
A realizer, commonly known as Schnyder woods, of a triangulation is a pa...
read it

Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs
Unit disk graphs are graphs that have a unit disk intersection represent...
read it

SpaceEfficient Algorithms for Reachability in Geometric Graphs
The problem of graph Reachability is to decide whether there is a path f...
read it

Light Euclidean Steiner Spanners in the Plane
Lightness is a fundamental parameter for Euclidean spanners; it is the r...
read it

On Euclidean Steiner (1+ε)Spanners
Lightness and sparsity are two natural parameters for Euclidean (1+ε)sp...
read it

Parameterized Algorithms for Queue Layouts
An hqueue layout of a graph G consists of a linear order of its vertice...
read it

Dynamic Geometric Independent Set
We present fully dynamic approximation algorithms for the Maximum Indepe...
read it

Parameterized Study of Steiner Tree on Unit Disk Graphs
We study the Steiner Tree problem on unit disk graphs. Given a n vertex ...
read it

Planar Bichromatic Bottleneck Spanning Trees
Given a set P of n red and blue points in the plane, a planar bichromati...
read it

Balanced Independent and Dominating Sets on Colored Interval Graphs
We study two new versions of independent and dominating set problems on ...
read it

Independent Sets of Dynamic Rectangles: Algorithms and Experiments
We study the maximal independent set (MIS) and maximum independent set (...
read it

Geometric Systems of Unbiased Representatives
Let P be a set of points in ℝ^d, B a bicoloring of P and a family of ge...
read it

Geometric Planar Networks on Bichromatic Points
We study four classical graph problems – Hamiltonian path, Traveling sal...
read it

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

Parameterized Algorithms for Book Embedding Problems
A kpage book embedding of a graph G draws the vertices of G on a line a...
read it

Algorithm and Hardness results on Liar's Dominating Set and ktuple Dominating Set
Given a graph G=(V,E), the dominating set problem asks for a minimum sub...
read it

The Balanced Connected Subgraph Problem
The problem of computing induced subgraphs that satisfy some specified r...
read it
Sujoy Bhore
is this you? claim profile