Sandip Banerjee

activity

20132023

most citedParameterized Approximation for Robust Clustering in Discrete Geometric Spaces

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2023

Maximum-Width Rainbow-Bisecting Empty Annulus

Sang Won Bae, Sandip Banerjee, Arpita Baral +2

Given a set of $n$ colored points with $k$ colors in the plane, we study the problem of computing a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-para…

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…

cs.CG2014

On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach

Sandip Banerjee, Aritra Banik, Bhargab B. Bhattacharya +2

In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \cite{croft91,tutte69} in the 1960s by Dumitrescu and T{ó}th \cite{adriancasaba2…

Maximum-Width Rainbow-Bisecting Empty Annulus

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

On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach

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