Dipayan Chakraborty

32 papers B 2C 4Journal 20Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set.
Electron. J. Comb.
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tero Laihonen
2026 J jnl
Identifying codes in graphs of given maximum degree: Characterizing trees.
Discret. Math.
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tuomo Lehtilä
2026 J jnl
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree.
Discret. Appl. Math.
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning
2026 J jnl
On full-separating sets and related codes in graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Annegret K. Wagler
2026 J jnl
On the Complexity of Vertex-Splitting Into an Interval Graph.
CoRR
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid
2026 J jnl
The Interplay Between Domination and Separation in Graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2025 J jnl
A linear algorithm for radio k-coloring of powers of paths having small diameters.
J. Comput. Syst. Sci.
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
2025 — conf
On Full-Separating Sets in Graphs.
CALDAM
Dipayan Chakraborty, Annegret K. Wagler
2025 J jnl
On open-separating dominating codes in graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Annegret K. Wagler
2025 — conf
Structural Parameterization of Locating-Dominating Set and Test Cover.
CIAC (1)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2025 C conf
The Interplay Between Domination and Separation in Graphs.
LAGOS
Dipayan Chakraborty, Annegret K. Wagler
2024 — conf
Location-Domination Type Problems Under the Mycielski Construction.
CALDAM
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret K. Wagler
2024 J jnl
On Three Domination-based Identification Problems in Block Graphs.
Fundam. Informaticae
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2024 J jnl
On full-separating sets in graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
On locating and neighbor-locating colorings of sparse graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2024 C conf
Open-Separating Dominating Codes in Graphs.
ISCO
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
Open-separating dominating codes in graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
Progress towards the two-thirds conjecture on locating-total dominating sets.
Discret. Math.
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2024 J jnl
Structural Parameterization of Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 — —
Structural and algorithmic aspects of identification problems in graphs. (Algorithmique et structure des problèmes d'identification).
Dipayan Chakraborty
2024 B conf
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
ISAAC
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 J jnl
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2023 C conf
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter.
IWOCA
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023 B conf
Contracting Edges to Destroy a Pattern: A Complexity Study.
FCT
Dipayan Chakraborty, R. B. Sandeep
2023 J jnl
Contracting edges to destroy a pattern: A complexity study.
CoRR
Dipayan Chakraborty, R. B. Sandeep
2023 C conf
Identifying codes in bipartite graphs of given maximum degree.
LAGOS
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
2023 — conf
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.
CALDAM
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023 J jnl
New bounds and constructions for neighbor-locating colorings of graphs.
CoRR
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023 — conf
On Three Domination-Based Identification Problems in Block Graphs.
CALDAM
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2023 J jnl
On clique numbers of colored mixed graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
2022 J jnl
Progress towards the two-thirds conjecture on locating-total dominating sets.
CoRR
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2021 J jnl
On clique numbers of colored mixed graphs.
CoRR
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen