Maleika Mehr Nigar Mohamed Heenaye-Mamode Khan

Summary: 

Tomas Vetrik

Summary: 

Extremal problems in graph theory related to distances in graphs, diameter of a graph, vertex degrees, vertex-transitive graphs and Cayley graphs will be studied in the lectures. The lecturer will introduce those concepts, and present theorems and proofs of some theorems. The theory will be illustrated by a lot of examples. The lecturer will also include research topics with applications in computer science, such as the degree-diameter problem, in his lectures. 
 

Didier Aussel

Summary: 

The aim of this course is fourfold, namely :

1. to introduce multi-leader-follower games
2. to explore the recent theoretical advances
3. to present some of the numerous applications of these optimization model
4. to present, in the case of Single-Leader-Follower games (SLMFG), the very recently  tested SOS1-numerical  scheme  to  determine,  numerically,  some solutions of these difficult problems.
 

Patrick Tchepmo Djomegni

Summary: De ce cours, nous espérons que les étudiants auront des outils minimums pour modéliser la propagation des maladies épidémiques, et étudier des stratégies de contrôle. Les étudiants acquerront de connaissances nouvelles qui les prépareront pour leurs travaux thèse (mémoire). L’université en bénéficiera aussi à travers le renforcement des capacités de ses futurs enseignants. 
 

Etienne Pardoux

Summary: On présente les mesures aléatoires de Poisson, et comment celles-ci permettent de construire les processus de Lévy, mais aussi les équations différentielles stochastiques à sauts, ainsi que les processus de branchement à espace d’état continu

Didier Jean CAUCAL

Summary: In this automaticity course we will teach the recognition of infinite words by automata. We will study the complexity of these infinite words and the non-algebraicity of the irrational numbers they represent. We will discuss its extension via battery-powered automata.