New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (CALDAM, 2023)

Contracting Edges to Destroy a Pattern: A Complexity Study. - Dipayan Chakraborty; R. B. Sandeep (FCT, 2023)

A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (IWOCA, 2023)

Identifying codes in bipartite graphs of given maximum degree. - Dipayan Chakraborty; Florent Foucaud; Tuomo Lehtilä (LAGOS, 2023)

On clique numbers of colored mixed graphs. - Dipayan Chakraborty; Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Location-Domination Type Problems Under the Mycielski Construction. - Silvia M. Bianchi; Dipayan Chakraborty; Yanina Lucarini; Annegret Katrin Wagler (CALDAM, 2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (ISAAC, 2024)

On locating and neighbor-locating colorings of sparse graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Discret. Appl. Math., 2024)

Progress towards the two-thirds conjecture on locating-total dominating sets. - Dipayan Chakraborty; Florent Foucaud; Anni Hakanen; Michael A. Henning; Annegret Katrin Wagler (Discret. Math., 2024)

On Three Domination-based Identification Problems in Block Graphs. - Dipayan Chakraborty; Florent Foucaud; Aline Parreau; Annegret Wagler (Fundam. Informaticae, 2024)

Structural and algorithmic aspects of identification problems in graphs. (Algorithmique et structure des problèmes d'identification). - Dipayan Chakraborty (2024)

On Full-Separating Sets in Graphs. - Dipayan Chakraborty; Annegret Katrin Wagler (CALDAM, 2025)

Structural Parameterization of Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (CIAC (1), 2025)

On open-separating dominating codes in graphs. - Dipayan Chakraborty; Annegret Katrin Wagler (Discret. Appl. Math., 2025)

A linear algorithm for radio k-coloring of powers of paths having small diameters. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (J. Comput. Syst. Sci., 2025)