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. I am interested in most other problems in graph theory and I like exploring both combinatorial and algorithmic aspects of such problems. You can find me and my work on any of the following platforms:


  •   
  •   
  •   
  •   
  •   


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

  • : LIMOS-ISIMA, Université Clermont-Auvergne

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

    Publications


    Accepted (journal and conference)

  • [CA01] 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), Leibniz International Proceedings in Informatics, to appear (2024). [arXiv]

  • Submitted (journal)


    Published (journal)


    Published (conference)

    • [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]
    • [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 . [arXiv | 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 / Colloquium Talks

    Identification Problems in Graphs [Slides]

    On three domination-based identification problems in block graphs

    On clique numbers of colored mixed graphs

    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.