Recherche
We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to
/Exposé en anglais/Talk in english/ The stack number of a directed acyclic graph G is the minimum k for which there is a topological ordering of G and
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