Recherche
/Exposé en anglais/Talk in english/ Given n points in the plane, a spanning tree is a set of n-1 straight line edges connecting them while inducing a
/Exposé /Talk/ We introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the
/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the
Given a relational specification \varphi(X, Y_1, ... Y_n), Boolean functional synthesis concerns the construction of Boolean functions F_1(X), ... F_n
In this talk, we present the paper "Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits" by Nikita A. Zemlevskiy, where
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
[ICQ] Maxime Cautrès (LIG) Vertex-minor universal graphs for generating entangled quantum subsystems
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
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
Detecting and Explaining Privacy Risks on Temporal Data Speaker: Marie-Christine Rousset, Professor at University of Grenoble Abstract: Personal data