Emplacement
Dates
Présentation
Since the works of Watts and Strogatz (1998) on one hand, and Barabási and Albert (1999) on the other, graph theory has become a major mathematical field that provides a framework to handle network properties theoretically and enables us with very powerful tools to model and solve problems on networks. Understanding their graph structure is a key point in deriving efficient algorithms in large networks. In this school, we will cover theoretical aspects of graph structure analysis as well as applications on complex network studies with 9 lectures in two main axes:
-
1) Exploiting graph structure to efficiently solve combinatorial problems
-
2) Extending graph structural analysis to complex network studies
This 12 days program enriched with wonderful social activities will take place in the extremely stimulating environment of the Nesin Mathematics Village (Leelavati prize 2018:https://www.mathunion.org/imu-awards/leelavati-prize/leelavati-prize-20…), and will offer the possibility of starting new and innovative collaborations with young researchers.
Langue officielle de l'école : anglais
Coordinateurs administratifs et scientifiques
Programme scientifique
Cours 1: "Fragments of Domination Theory in Graphs -- Invariants, Interrelations, and Algorithmic Aspects", Martin Milanic (University of Primorska, Slovenie)
Cours 2: "Geometric and Topological Graph Analysis for Machine Learning Applications ", Tina Eliassi-Rad (Northeastern University, USA)
Cours 3: "Modifying Graph Parameters via Graph Operations ", Bernard Ries (Université de Fribourg, Suisse)
Cours 4: "Dominating Sequences in Graphs", Didem Gözüpek (Gebze Technical University, Turkie)
Cours 5: "Diffusive Models on Graphs and Networks", Ernesto Estreda ( University of the Balearic Islands, Espagne)
Cours 6: "Algorithms for the Analysis of Interaction Streams", Clémence Magnien (Sorbonne Université, France)
Cours 7: "Algorithmic Techniques for Edge Modification Problems ", Christophe Crespelle (Université Claude Bernard Lyon 1, Lyon, France)
Cours 8: "Domination Parameters in Graphs", Joanna Raczek (Gdansk University of Technology, Pologne)
Cours 9: "Integer Programming Formulations and Exact Algorithms for Hard Combinatorial Optimization Problems on Graphs", Fabio Furini (Sapienza Università di Roma, Italie)
Site internet de l'école
Comment participer
Pour s'inscrire et postuler à un financement CIMPA, suivre les instructions données ici.
Date limite d'inscription et de candidature : 21 février 2023
Date limite d'inscription : février 21, 2023