Dipayan Chakraborty

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 18

Top Topics

Mutual Reinforcement

Graph Clustering

Top Venues

Discret. Appl. Math.

Fundam. Informaticae

Publications

Dipayan Chakraborty, Annegret Katrin Wagler
Open-Separating Dominating Codes in Graphs. ISCO (2024)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358 (2024)
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler
Location-Domination Type Problems Under the Mycielski Construction. CALDAM (2024)
Dipayan Chakraborty, Annegret Katrin Wagler
Open-separating dominating codes in graphs. CoRR (2024)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347 (12) (2024)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191 (3-4) (2024)
Dipayan Chakraborty, Annegret Katrin Wagler
On full-separating sets in graphs. CoRR (2024)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR (2024)
Dipayan Chakraborty, R. B. Sandeep
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT (2023)
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree. LAGOS (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM (2023)
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. IWOCA (2023)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324 (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New bounds and constructions for neighbor-locating colorings of graphs. CoRR (2023)
Dipayan Chakraborty, R. B. Sandeep
Contracting edges to destroy a pattern: A complexity study. CoRR (2023)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler
On Three Domination-Based Identification Problems in Block Graphs. CALDAM (2023)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR (2022)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. CoRR (2021)