Recherche
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core
In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal
Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal
Titre: "ON ROBUSTNESS FOR THE SKOLEM and related PROBLEMS" Blaise Genest (IPAL, Singapore) abstract: The Skolem problem is a long-standing open
[Soutenance en anglais/Talk in english] Cette thèse traite des questions structurelles de la théorie des graphes qui découlent de motivations