Hi! I'm Dipayan...

I am a doctoral fellow at the Department of Computer Science (LIMOS / ISIMA) at the Université Clermont Auvergne, France under Annegret K. Wagler (director of PhD thesis) and Florent Foucaud (co-supervisor of PhD thesis) working on domination-based identification problems in graph theory. I am also a research associate to Prof. Michael Henning at the Department of Mathematics and Applied Mathematics, University of Johannesburg, South Africa. 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:


  •   
  •   
  •   
  •   
  •   


  • : name.surname[AT]uca[DOT]fr

  • : LIMOS-ISIMA, Université Clermont-Auvergne

  • 1 Rue de la Chebarde, 63178 Aubière, France

    • Dipayan Chakraborty

    Journal Publications

    Submitted

    Published, 2023

    Conference Proceedings

    Published, 2024

    • [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]

    • [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. [doi]

    Published, 2023

    • [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]

    • [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 . [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. [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. [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. [doi]

    Seminar Talks

    Identification Problems in Graphs [Slides]

    Courses Taught

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

    [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.