Speakers

Prof. Florent Foucaud is an associate professor (maître de conférences) at the Université Clermont Auvergne, France. His research is in graph algorithms and graph theory. Some of his favorite graph problems include graph identification problems (in particular, identifying codes and metric dimension), graph homomorphisms, graph domination or metric-based covering and packing problems. He is interested both in structural aspects and the algorithmic complexity of such graph problems. 

Prof. Sagnik Sen is an assistant professor at IIT Dharwad (India) and holds the position of head of the Department of Mathematics. His primary research interest is in graph homomorphisms and colorings. He analyses the structural aspects of graph homomorphisms and study coloring as a special case. He particularly focuses on graphs having different types of adjacency rules and, therefore, has worked on homomorphisms of oriented graphs, signed graphs, (n,m)-graphs, etc. He has worked on a wide range of graph theory topics, such as algebraic graph theory, radio labeling, combinatorial games, graph distance-related parameters, geometric graphs, graph modification problems, etc.