8 citations · 10 across the 3 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…
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee +3
A {\em tournament} is a directed graph such that every pair of vertices is connected by an arc. A {\em feedback vertex set} is a set of vertices in such that is…
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…