Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Dibyayan Chakraborty

Dibyayan Chakraborty

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1Discrete Math×1

Frequent co-authors

Sandip Das1×
Florent Foucaud1×
Harmender Gahlawat1×
Dimitri Lajou1×

Research Timeline

2026
Algorithms and complexity for geodetic sets on interval and chordal graphs

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on interval graphs.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.DMTheoreticalRecentJun 29, 2026

Algorithms and complexity for geodetic sets on interval and chordal graphs

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat +1 more

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

View →