Accepted (journal and conference)

Published (journal)

• [JP05] DC, Soumen Nandi, Sagnik Sen and Supraja DK. A linear algorithm for radio k-coloring of powers of paths having small diameters. Journal of Computer and System Sciences 147: 103577 (2024). [arXiv | doi | conference version (IWOCA 2023)]
  
• [JP04] DC, Florent Foucaud, Anni Hakanen, Michael Henning and Annegret Wagler. Progress towards the two-thirds conjecture on locating-total dominating sets. Discrete Mathematics 347(12): 114176 (2024). [arXiv | doi]
  
• [JP03] DC, Florent Foucaud, Soumen Nandi, Sagnik Sen and Supraja DK. On locating and neighbor-locating colorings of sparse graphs. Discrete Applied Mathematics 358: 366-381 (2024). [arXiv | doi | conference version (CALDAM 2023)]
  
• [JP02] DC, Florent Foucaud, Aline Parreau and Annegret Wagler. On three domination-based identification problems in block graphs. Fundamenta Informaticae (special issue on the occassion of Iro Honkala's 60th birthday) 191(3-4): 197-229 (2024). [arXiv | doi | conference version (CALDAM 2023)]
  
• [JP01] DC, Sandip Das, Soumen Nandi, Debdeep Roy and Sagnik Sen. On clique numbers of colored mixed graphs. Discrete Applied Mathematics 324: 29-40 (2023). [arXiv | doi]
  

Published (conference)

• [CP09] DC and Annegret K. Wagler. On full-separating sets in graphs. 11th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Feb 2025, Coimbatore, India. [arXiv | doi]
  
• [CP08] DC, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. Tight (double) exponential bounds for identification problems: locating-dominating set and test cover. 35th International Symposium on Algorithms and Computation (ISAAC 2024), Sydney, Australia, to appear (2024). [arXiv | doi]
  
• [CP07] DC and Annegret K. Wagler. Open-separating dominating codes in graphs. 8th International Symposium on Combinatorial Optimization (ISCO), May 2024, Tenerife, Canary Islands, Spain. [arXiv | doi]
  
• [CP06] Silvia M. Bianchi, DC, Yanina Lucarini and Annegret K. Wagler. Location-domination type problems under the Mycielski construction. 10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Feb 2024, Bhilai, India. [arXiv | doi]
  
• [CP04] DC and Sandeep RB. Contracting edges to destroy a pattern: A complexity study. 24th International Symposium on Fundamentals of Computation Theory (FCT), Sept 2023, Trier, Germany . [arXiv | doi]
  
• [CP05] DC, Florent Foucaud, and Tuomo Lehtilä. Identifying codes in bipartite graphs of given maximum degree. XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Sept 2023, Huatulco, Mexico. [ doi ]
  
• [CP03] DC, Soumen Nandi, Sagnik Sen and Supraja DK. A linear algorithm for radio k-coloring powers of paths having small diameter. 34th International Workshop on Combinatorial Algorithms (IWOCA), June 2023, Tainan, Taiwa. [arXiv | doi]
  
• [CP02] DC, Florent Foucaud, Aline Parreau and Annegret K. Wagler. On three domination-based identification problems in block graphs. 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Feb 2023, Gandhinagar, India. [arXiv | doi]
  
• [CP01] DC, Florent Foucaud, Soumen Nandi, Sagnik Sen and Supraja DK. New bounds and constructions for neighbor-locating colorings of graphs. 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Feb 2023, Gandhinagar, India. [arXiv | doi]
  

Submitted (journal)

• [JS10] DC, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. On the Structural Parameterizations of Locating-Dominating Set and Test Cover . Manuscript, 2024. [arXiv]
  
• [JS09] DC, Florent Foucaud, Michael Henning and Tero Laihonen. Partitioning the vertex set of a graph into a dominating set and a locating dominating set. Manuscript, 2025. [arXiv]
  
• [JS08] DC and Annegret K. Wagler. On full-separating sets and related codes in graphs. Manuscript, 2025. [arXiv]
  
• [JS07] DC and Annegret K. Wagler. On lower bounds for cardinalities of several separating-dominating codes in graphs. Manuscript, 2025. [arXiv]
  
• [JS06] DC and Annegret K. Wagler. On open-separating dominating codes in graphs. Manuscript, 2025. [arXiv]
  
• [JS05] DC, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. Tight (double) exponential bounds for identification problems: locating-dominating set and test cover. Manuscript, 2024. [arXiv]
  
• [JS04] DC, Florent Foucaud and Michael Henning. Identifying open codes in trees and 4-cycle-free graphs of given maximum degree. Manuscript, 2024. [arXiv]
  
• [JS03] DC, Florent Foucaud, Michael Henning and Tuomo Lehtilä. Identifying codes in triangle-free graphs of bounded maximum degree. Manuscript, 2024. [arXiv]
  
• [JS02] DC, Anni Hakanen and Tuomo Lehtilä. The n/2-bound for locating-dominating sets in subcubic graphs. Manuscript, 2024. [arXiv]
  
• [JS01] DC, Florent Foucaud, Michael Henning and Tuomo Lehtilä. Identifying codes in graphs of given maximum degree: Characterzing trees. Manuscript, 2024. [arXiv | conference version (LAGOS 2023)]
  

On full-separating sets in graphs

• Presented at 26ème Journées Graphes et Algorithmes (JGA), organized by l'Université de Bourgogne, Dijon, France, November, 2024 [Slides]
  

PhD Defense: Structural and Algorithmic aspects of Identification Problems

• Presented at Université Clermont Auvergne, Clermont-Ferrand, France, December, 2024 [Slides]
  

Identification Problems in Graphs [Slides]

• BITS Pilani, K K Birla, Goa Campus, Goa, India, February 2024
  
• Indian Statistical Institute, Kolkata, India, January 2024
  
• Chennai Mathematical Institute, Tamil Nadu, India, January 2024
  
• IIT Dharwad, Karnataka, India, January 2024
  

On three domination-based identification problems in block graphs

• Maribor Graph Theory Conference, Maribor, Slovenia, September 2022 [Slides]
  
• 11th International Colloquium on Graph Theory and Combinatorics, Montpellier, France, July 2022 [Slides]
  

On clique numbers of colored mixed graphs

• Homomorphisms of Signed Graphs (HOSIGRA), Online annual meeting, May 2021 [Slides]