Dipayan Chakraborty

Orcid: 0000-0001-7169-7288

According to our database1, Dipayan Chakraborty authored at least 10 papers between 2022 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Open-separating dominating codes in graphs.
CoRR, 2024

Location-Domination Type Problems Under the Mycielski Construction.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
On clique numbers of colored mixed graphs.
Discret. Appl. Math., 2023

Identifying codes in bipartite graphs of given maximum degree.
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.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Contracting Edges to Destroy a Pattern: A Complexity Study.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

On Three Domination-Based Identification Problems in Block Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Progress towards the two-thirds conjecture on locating-total dominating sets.
CoRR, 2022


  Loading...