5 citations · 8 across the 7 of their papers we have counts for
5 papers · 1 filter
Minimum eccentricity shortest paths of -minor-free graphs
Dibyayan Chakraborty, Sandip Das, Sk Samim Islam +2
Given a simple, undirected, and unweighted graph , and an integer , the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists…
Algorithms and complexity for geodetic sets on interval and chordal graphs
Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2
We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set of vertices of a graph is a \textit{geodetic se…
Parameterized complexity of isometric path partition: treewidth and diameter
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud +2
We investigate the parameterized complexity of the Isometric Path Partition problem when parameterized by the treewidth () of the input graph, arguably one of the most…
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri +1
In this paper, we study the computational complexity of \textsc{-Club Cluster Vertex Deletion}. Given a graph, \textsc{-Club Cluster Vertex Deletion (-CVD)} aims to delete…
Twin-width VIII: delineation and win-wins
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim +3
We introduce the notion of delineation. A graph class is said delineated if for every hereditary closure of a subclass of , it holds that $\ma…