8 citations · 10 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
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…
cs.DM2018
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…