Recherche

/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

We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer

In a functional program, a function may take an argument that is itself... a function. When it comes to model-checking, that implies that the tree of

We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to

Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal

Ce guide s'adresse d'abord aux étudiants et (nouveaux) chercheurs du LaBRI pour leur donner les points d'accès principaux aux ressources documentaires

[Soutenance en anglais/Talk in english] Cette thèse traite des questions structurelles de la théorie des graphes qui découlent de motivations