## Hi! I'm Dipayan...

I am a doctoral fellow at the Department of Computer Science (LIMOS / ISIMA) at the Université Clermont Auvergne, France under the supervision of Annegret K. Wagler , Florent Foucaud and Michael Henning working on domination-based identification problems in graph theory. My other areas of research interests include graph colorings, graph homomorphisms and graph modification problems. Find me and my work by clicking on any of the following icons:

## Publications

## Accepted (journal and conference)

**Tight (double) exponential bounds for identification problems: Locating-Dominating Set and Test Cover.**

*35th International Symposium on Algorithms and Computation (ISAAC 2024), Leibniz International Proceedings in Informatics*, to appear (2024). [arXiv]

## Submitted (journal)

- [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, Anni Hakanen and Tuomo Lehtilä.
**The n/2-bound for locating-dominating sets in subcubic graphs.***Manuscript, 2024*. [arXiv] - [JS02] DC, Florent Foucaud, Michael Henning and Tuomo Lehtilä.
**Identifying codes in triangle-free graphs of bounded maximum degree.***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)]

## 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, 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)] - [JP03] 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)] - [JP02] 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] - [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 without journal version yet)

- [CP03] 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] - [CP02] 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] - [CP01] 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]

## Seminar / Colloquium Talks

## 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]

## Courses Taught

## [2022-2024] IUT Clermont Auvergne, Aubière, France

- Methodes d'Optimisation le Bachelor Universitaire de Technologie (BUT) Informatique - 2nd year

## [2016-2020] GMIT (affiliated to MAKAUT), Kolkata, India

- Mathematics-I A & B (Single & Multivariate Calculus || Linear algebra) Bachelor of Technology (B. Tech) - 1st year
- Mathematics-II A & B (Probability & Statistics || Multivariate Calculus || Differential Equations || Complex Analysis) Bachelor of Technology (B. Tech) - 1st year
- Mathematics-III (Differential Calculus || Differential Equations || Partial Differential Equations || Integral Transforms || Probability & Statistics) Bachelor of Technology (B. Tech) - 2nd year
- Mathematics-IV (Numerical Methods || Abstract Algebra || Basics of Graph Theory) Bachelor of Technology (B. Tech) - 2nd year

## [2015-2016] GCECT (affiliated to MAKAUT), Kolkata, India

- Engineering Mathematics (Probability || Fourier Analysis || Integral Transforms || Ordinary & Partial Differential Equations) Bachelor of Technology (B. Tech) - 2nd year.