Dipayan Chakraborty's Web Page

Hi! I'm Dipayan...

ATER

Ecole Centrale Méditerranée

ACRO

LIS

Aix-Marseille Université

Department of Computer Science and Mathematics

Lebanese American University

Faisal N. Abu-Khzam

LIMOS

Université Clermont Auvergne

Annegret K. Wagler

Florent Foucaud

Michael Henning

Department of Mathematics and Applied Mathematics, University of Johannesburg

Michael Henning

: name[DOT]surname[AT]centrale-med[DOT]fr

: name[DOT]surname[AT]lis-lab[DOT]fr

: name[DOT]surname[AT]univ-amu[DOT]fr

: Centrale Méditerranée, Technopôle Château-Gombert

38 rue Frédéric Joliot-Curie, 13013 Marseille, France

Publications

Accepted (journal and conference)

[JA01] 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, 2026.
[HAL]

Published (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)

[CP11] The interplay between domination and separation in graphs.
with Annegret K. Wagler. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025), November 2025, Buenos Aires, Argentina. Procedia Computer Science 273: 78-85 (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 2025), June 2025, Rome, Italy. Lecture Notes in Computer Science 15679: 187-204 (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 2025), Feb 2025, Coimbatore, India. Lecture Notes in Computer Science 15536: 73-84 (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 2024), May 2024, Tenerife, Canary Islands, Spain. Lecture Notes in Computer Science 14594: 137-151 (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 2024), Feb 2024, Bhilai, India. Lecture Notes in Computer Science 14508: 255-269 (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 2023), Sept 2023, Trier, Germany. Lecture Notes in Computer Science 14292: 118-131 (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), June 2023, Tainan, Taiwa. Lecture Notes in Computer Science 13889: 148-159 (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 2023), Feb 2023, Gandhinagar, India. Lecture Notes in Computer Science 13947: 271-283 (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 2023), Feb 2023, Gandhinagar, India. Lecture Notes in Computer Science 13947: 121-133 (2023).
[arXiv | Conf. DOI | Slides -- presented by Supraja DK]

Submitted / In progress

[IP01] On the Complexity of Vertex-Splitting Into an Interval Graph.
with Faisal N. Abu-Khzam, Lucan Isenmann and Nacim Oijid. Manuscript, 2026.
[arXiv]

[JS05] On the Structural Parameterizations of Locating-Dominating Set and Test Cover.
with Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. Manuscript, 2024.
[arXiv]

[JS04] On lower bounds for cardinalities of several separating-dominating codes in graphs.
with Annegret K. Wagler. Manuscript, 2025.
[arXiv]

[JS03] Tight (double) exponential bounds for identification problems: locating-dominating set and test cover.
with Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale. Manuscript, 2024.
[arXiv]

[JS02] Identifying codes in triangle-free graphs of bounded maximum degree.
with Florent Foucaud, Michael Henning and Tuomo Lehtilä. Manuscript, 2024.
[arXiv]

[JS01] The n/2-bound for locating-dominating sets in subcubic graphs.
with Anni Hakanen and Tuomo Lehtilä. Manuscript, 2024.
[arXiv]

Seminars / Talks

Parameterizations of locating dominating sets

Seminar of Team ACRO: Algorithmique, Combinatoire et Recherche Opérationnelle, Laboratoire d'Informatique et des Systèmes (LIS), Marseille, France, December, 2025 [Slides]

On full-separating sets in graphs

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

Université Clermont Auvergne, Clermont-Ferrand, France, December, 2024 [Slides | HAL theses | Manuscript]

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

[2025-2026] Centrale Méditerranée, Château-Gombert, Marseille, France

Informatique (S5 et S6) (L1 - tronc commun - ingénierie)

Python scientifique (S7) (L2 MIE - Mathématiques-Informatique-Economie)

[2025-2026] Aix-Marseille Université, Saint Jérôme, Marseille, France

Programmation et algorithmique (S2) (L1 MPCI - Mathématiques, Physique, Chimie et Informatique)

Algorithmique des arbres et graphes (S3) (L2 MPCI - Mathématiques, Physique, Chimie et Informatique)

[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

Graph Theory and Algorithms ● Linear and Abstract Algebra ● Probability ● Real and Complex Analysis ● Numerical Methods ● Differential Calculus ● Integral Transforms (For topic wise syllabus, click here)

Civil Engineering

Computer Science Engineering

Electronics and Communications Engineering

Electrical Engineering

Mechanical Engineering

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

Probability ● Integral Transforms ● Fourier Analysis ● Differential Equations (For topic wise syllabus, click here)

Ceramic Technology