Recherche
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
/Exposé en anglais/Talk in english/ The Alon-Jaeger-Tarsi conjecture states that for any finite field F of size at least 4 and any nonsingular matrix
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