9 citations · 22 across the 21 of their papers we have counts for
3 papers · 1 filter
Approximating Minimum Dominating Set on String Graphs
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
In this paper, we give approximation algorithms for the \textsc{Minimum Dominating Set (MDS)} problem on \emph{string} graphs and its subclasses. A \emph{path} is a simple curve ma…
On the stab number of rectangle intersection graphs
Dibyayan Chakraborty, Mathew C. Francis
We introduce the notion of \emph{stab number} and \emph{exact stab number} of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph is said to…
On bounds on bend number of split and cocomparability graphs
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee +1
A path is a simple, piecewise linear curve made up of alternating horizontal and vertical line segments in the plane. A -bend path is a path made up of at most line segm…