Dibyayan Chakraborty

From MaRDI portal
Person:778516

Available identifiers

zbMath Open chakraborty.dibyayanMaRDI QIDQ778516

List of research outcomes





PublicationDate of PublicationType
Isometric path complexity of graphs2024-12-03Paper
Kempe equivalent list colorings revisited2024-09-16Paper
Complexity and algorithms for isometric path cover on chordal graphs and beyond2024-09-11Paper
Cutting Barnette graphs perfectly is hard2024-08-20Paper
Distance-based covering problems for graphs of given cyclomatic number2024-05-29Paper
Recognizing geometric intersection graphs stabbed by a line2024-03-28Paper
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs2024-01-09Paper
$\chi$-binding functions for squares of bipartite graphs and its subclasses2023-12-14Paper
https://portal.mardi4nfdi.de/entity/Q60653962023-11-14Paper
Algorithms and complexity for geodetic sets on partial grids2023-10-26Paper
Finding geometric representations of apex graphs is \textsf{NP}-hard2023-08-18Paper
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs2023-05-05Paper
Triangle-free projective-planar graphs with diameter two: domination and characterization2023-03-29Paper
Cutting Barnette graphs perfectly is hard2023-02-22Paper
Isometric path complexity of graphs2022-12-31Paper
Triangle-free projective-planar graphs with diameter two: domination and characterization2022-12-08Paper
Finding geometric representations of apex graphs is NP-hard2022-07-13Paper
On dominating set of some subclasses of string graphs2022-06-13Paper
Twin-width VIII: delineation and win-wins2022-04-01Paper
Algorithms and complexity of \(s\)-club cluster vertex deletion2022-03-22Paper
On rectangle intersection graphs with stab number at most two2020-12-29Paper
Hardness and approximation for the geodetic set problem in some graph classes2020-07-21Paper
On the stab number of rectangle intersection graphs2020-07-02Paper
Dominating set on overlap graphs of rectangles intersecting a line2020-02-24Paper
Approximating minimum dominating set on string graphs2020-02-24Paper
On rectangle intersection graphs with stab number at most two2019-10-10Paper
Bounds on the bend number of split and cocomparability graphs2019-09-05Paper
Bottleneck bichromatic full Steiner trees2018-12-05Paper
On Local Structures of Cubicity 2 Graphs2017-02-01Paper
On a Special Class of Boxicity 2 Graphs2015-02-19Paper
Kempe Equivalent List Colorings RevisitedN/APaper
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?N/APaper

Research outcomes over time

This page was built for person: Dibyayan Chakraborty