Dibyayan Chakraborty

activity

20162026

most citedTwin-width VIII: delineation and win-wins

5 citations · 10 across the 17 of their papers we have counts for

collaborators

Showing 2026 · cs.DSShow all

2 papers · 2 filters

cs.DS2026

Minimum eccentricity shortest paths of $K_{2, 3}$ -minor-free graphs

Dibyayan Chakraborty, Sandip Das, Sk Samim Islam +2

Given a simple, undirected, and unweighted graph $G$ , and an integer $R$ , the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists…

cs.DS2026

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 $S$ of vertices of a graph $G$ is a \textit{geodetic se…

Minimum eccentricity shortest paths of K2,3​-minor-free graphs

Algorithms and complexity for geodetic sets on interval and chordal graphs

Minimum eccentricity shortest paths of $K_{2, 3}$ -minor-free graphs