Dipayan Chakraborty's Web Page

Publications

Published (journal)

[JP13] The n/2-bound for locating-dominating sets in subcubic graphs.
with Anni Hakanen and Tuomo Lehtilä. Graphs and Combinatorics 33, 72 (2026).
[arXiv | journal ]

[JP12] Tight (double) exponential bounds for identification problems: locating-dominating set and test cover.
with Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. SIAM Journal on Discrete Mathematics 40(3) (2026).
[arXiv | journal]

[JP11] Identifying codes in triangle-free graphs of bounded maximum degree.
with Florent Foucaud, Michael Henning and Tuomo Lehtilä. Journal of Graph Theory 112(3) 306-336 (2026).
[arXiv | journal]

[JP10] Partitioning the vertex set of a graph into a dominating set and a locating dominating set.
with Florent Foucaud, Michael Henning and Tero Laihonen. The Electronic Journal of Combinatorics 33(1): #P1.51 (2026).
[HAL | journal]

[JP09] Identifying open codes in trees and 4-cycle-free graphs of given maximum degree.
with Florent Foucaud and Michael Henning. Discrete Applied Mathematics 386: 319-333 (2026).
[arXiv | journal]

[JP08] On full-separating sets and related codes in graphs.
with Annegret K. Wagler. Discrete Applied Mathematics 379: 551-569 (2026).
[arXiv | journal | conf. version (CALDAM 2025)]

[JP07] Identifying codes in graphs of given maximum degree: Characterzing trees.
with Florent Foucaud, Michael Henning and Tuomo Lehtilä. Discrete Mathematics 349(2): 114826 (2026).
[arXiv | journal | conf. version (LAGOS 2023)]

[JP06] On open-separating dominating codes in graphs.
with Annegret K. Wagler. Discrete Applied Mathematics 375: 215-238 (2025).
[arXiv | journal | conf. version (ISCO 2024)]

[JP05] A linear algorithm for radio k-coloring of powers of paths having small diameters.
with Soumen Nandi, Sagnik Sen and Supraja DK. Journal of Computer and System Sciences 147: 103577 (2024).
[arXiv | journal | conf. version (IWOCA 2023)]

[JP04] Progress towards the two-thirds conjecture on locating-total dominating sets.
with Florent Foucaud, Anni Hakanen, Michael Henning and Annegret Wagler. Discrete Mathematics 347(12): 114176 (2024).
[arXiv | journal]

[JP03] On locating and neighbor-locating colorings of sparse graphs.
with Florent Foucaud, Soumen Nandi, Sagnik Sen and Supraja DK. Discrete Applied Mathematics 358: 366-381 (2024).
[arXiv | journal | conf. version (CALDAM 2023)]

[JP02] On three domination-based identification problems in block graphs.
with Florent Foucaud, Aline Parreau and Annegret Wagler. Fundamenta Informaticae (special issue on the occassion of Iro Honkala's 60th birthday) 191(3-4): 197-229 (2024).
[arXiv | journal | conf. version (CALDAM 2023)]

[JP01] On clique numbers of colored mixed graphs.
with Sandip Das, Soumen Nandi, Debdeep Roy and Sagnik Sen. Discrete Applied Mathematics 324: 29-40 (2023).
[arXiv | journal]

Published (conference)

[CP12] On the Complexity of Vertex-Splitting Into an Interval Graph.
with Faisal N. Abu-Khzam, Lucas Isenmann and Nacim Oijid. The 37th International Workshop on Combinatorial Algorithms (IWOCA), Clermont-Ferrand, France. Combinatorial Algorithms, Lecture Notes in Computer Science 16587: 1-15 (June 2026).
[arXiv | Conf. DOI | Slides -- presented by myself]

[CP11] The interplay between domination and separation in graphs.
with Annegret K. Wagler. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS), Buenos Aires, Argentina. Procedia Computer Science 273: 78-85 (Nov. 2025).
[arXiv | Conf. DOI | Slides -- presented by Annegret K. Wagler]

[CP10] On the Structural Parameterizations of Locating-Dominating Set and Test Cover .
with Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. 14th International Conference on Algorithms and Complexity (CIAC), Rome, Italy. Algorithms and Complexity, Lecture Notes in Computer Science 15679: 187-204 (June 2025).
[arXiv | Conf. DOI | Slides -- presented by myself]

[CP09] On full-separating sets in graphs.
with Annegret K. Wagler. 11th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Coimbatore, India. Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science 15536: 73-84 (Feb. 2025).
[arXiv | Conf. DOI | Slides -- presented by Florent Foucaud (on behalf of authors)]

[CP08] Tight (double) exponential bounds for identification problems: locating-dominating set and test cover.
with Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. 35th International Symposium on Algorithms and Computation (ISAAC 2024), Dec 2024, Sydney, Australia. Leibniz International Proceedings in Informatics 322: 19:1-19:18 (2024).
[arXiv | Conf. DOI | Slides -- presented by Prafullkumar Tale]

[CP07] Open-separating dominating codes in graphs.
with Annegret K. Wagler. 8th International Symposium on Combinatorial Optimization (ISCO), Tenerife, Canary Islands, Spain. Combinatorial Optimization, Lecture Notes in Computer Science 14594: 137-151 (May 2024).
[arXiv | Conf. DOI | Slides -- presented by Annegret K. Wagler]

[CP06] Location-domination type problems under the Mycielski construction.
with Silvia M. Bianchi, Yanina Lucarini and Annegret K. Wagler. 10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Bhilai, India. Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science 14508: 255-269 (Feb. 2024).
[arXiv | Conf. DOI | Slides -- presented by myself]

[CP04] Contracting edges to destroy a pattern: A complexity study.
with Sandeep RB. 24th International Symposium on Fundamentals of Computation Theory (FCT), Trier, Germany. Fundamentals of Computation Theory, Lecture Notes in Computer Science 14292: 118-131 (Sep. 2023).
[arXiv | Conf. DOI | Slides -- presented by Sandeep RB]

[CP05] Identifying codes in bipartite graphs of given maximum degree.
with Florent Foucaud, and Tuomo Lehtilä. XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), Sept 2023, Huatulco, Mexico. Procedia Computer Science 223: 157-165 (2023).
[ Conf. DOI | Slides -- presented by myself]

[CP03] A linear algorithm for radio k-coloring powers of paths having small diameter.
with Soumen Nandi, Sagnik Sen and Supraja DK. 34th International Workshop on Combinatorial Algorithms (IWOCA), Tainan, Taiwa. Combinatorial Algorithms, Lecture Notes in Computer Science 13889: 148-159 (June 2023).
[arXiv | Conf. DOI | Slides -- presented by Supraja DK]

[CP02] On three domination-based identification problems in block graphs.
with Florent Foucaud, Aline Parreau and Annegret K. Wagler. 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Gandhinagar, India. Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science 13947: 271-283 (Feb. 2023).
[arXiv | Conf. DOI | Slides -- presented by myself]

[CP01] New bounds and constructions for neighbor-locating colorings of graphs.
with Florent Foucaud, Soumen Nandi, Sagnik Sen and Supraja DK. 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Gandhinagar, India. Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science 13947: 121-133 (Feb. 2023).
[arXiv | Conf. DOI | Slides -- presented by Supraja DK]