Scholar

Dibyayan Chakraborty

Google Scholar ID: HjcuaaQAAAAJ

University of Leeds

Graph algorithms

Homepage↗Google Scholar↗

Citations & Impact

All-time

Citations

205

H-index

9

i10-index

9

Publications

20

Co-authors

1

list available

Contact

No contact links provided.

Publications

5 items

Distance-based (and path-based) covering problems for graphs of given cyclomatic number

2025

Cited

0

Parameterized complexity of isometric path partition: treewidth and diameter

2025

Cited

0

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two

2025

Cited

0

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

2025

Cited

0

Isometric Path Complexity of Graphs

International Symposium on Mathematical Foundations of Computer Science · 2022

Cited

6

Resume (English only)

Co-authors

1 total

Florent Foucaud

LIMOS, Université Clermont Auvergne, France