Dibyayan Chakraborty

activity

20242026

most citedAlgorithms and complexity for geodetic sets on planar and chordal graphs

3 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

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…

cs.DS2025

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 ( $tw$ ) of the input graph, arguably one of the most…

cs.DS2024

Additive approximation algorithm for geodesic centers in $I^´$ -hyperbolic graphs

Dibyayan Chakraborty, Yann VaxÃ¨s

For an integer $k \geq 1$ , the objective of \textsc{ $k$ -Geodesic Center} is to find a set $C$ of $k$ isometric paths such that the maximum distance between any vertex $v$ …

Algorithms and complexity for geodetic sets on interval and chordal graphs

Parameterized complexity of isometric path partition: treewidth and diameter

Additive approximation algorithm for geodesic centers in I^´-hyperbolic graphs

Additive approximation algorithm for geodesic centers in $I^´$ -hyperbolic graphs