Dipayan Chakraborty

According to our database, Dipayan Chakraborty authored at least 13 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A linear algorithm for radio k-coloring of powers of paths having small diameters.

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja

J. Comput. Syst. Sci., 2025

2024

On Three Domination-based Identification Problems in Block Graphs.

Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler

Fundam. Informaticae, 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 locating and neighbor-locating colorings of sparse graphs.

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja

Discret. Appl. Math., 2024

On full-separating sets in graphs.

Dipayan Chakraborty, Annegret Katrin Wagler

CoRR, 2024

Open-Separating Dominating Codes in Graphs.

Dipayan Chakraborty, Annegret Katrin Wagler

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.

Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Location-Domination Type Problems Under the Mycielski Construction.

Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

On clique numbers of colored mixed graphs.

Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

Discret. Appl. Math., 2023

Identifying codes in bipartite graphs of given maximum degree.

Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter.

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Contracting Edges to Destroy a Pattern: A Complexity Study.

Dipayan Chakraborty, R. B. Sandeep

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023