Dipayan Chakraborty

Orcid: 0000-0001-7169-7288

According to our database¹, Dipayan Chakraborty authored at least 21 papers between 2023 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

Identifying codes in graphs of given maximum degree: Characterizing trees.

[BibT_eX]

[DOI]

Discret. Math., 2026

On full-separating sets and related codes in graphs.

[BibT_eX]

[DOI]

Dipayan Chakraborty

Annegret K. Wagler

Discret. Appl. Math., 2026

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree.

[BibT_eX]

[DOI]

Dipayan Chakraborty

Florent Foucaud

Michael A. Henning

Discret. Appl. Math., 2026

A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set.

[BibT_eX]

[DOI]

Electron. J. Comb., 2026

On the Complexity of Vertex-Splitting into an Interval Graph.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

2025

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2025

The Interplay Between Domination and Separation in Graphs.

[BibT_eX]

[DOI]

Dipayan Chakraborty

Annegret K. Wagler

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

Structural Parameterization of Locating-Dominating Set and Test Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

On Full-Separating Sets in Graphs.

[BibT_eX]

[DOI]

Dipayan Chakraborty

Annegret K. Wagler

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

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

[BibT_eX]

[DOI]

Dipayan Chakraborty

PhD thesis, 2024

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

[BibT_eX]

[DOI]

Discret. Math., 2024

On locating and neighbor-locating colorings of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Open-Separating Dominating Codes in Graphs.

[BibT_eX]

[DOI]

Dipayan Chakraborty

Annegret K. Wagler

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

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

[BibT_eX]

[DOI]

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

Location-Domination Type Problems Under the Mycielski Construction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

On clique numbers of colored mixed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Identifying codes in bipartite graphs of given maximum degree.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Contracting Edges to Destroy a Pattern: A Complexity Study.

[BibT_eX]

[DOI]

Dipayan Chakraborty

R. B. Sandeep

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

On Three Domination-Based Identification Problems in Block Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Dipayan Chakraborty

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...