Recherche
Hussein Kazemi (LaBRI) Title: Trajectory visibility at first sight Abstract: Let P be a simple polygon with n vertices, and let two moving entities q
/Exposé en français/Talk in french / English slides / transparents en anglais In this talk, I will given a rather simple construction of a graph U n
/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
/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
We use quantum devices from IBMQ to perform digital quantum simulations of the Schwinger model. We work with a quantum link model description of the
We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to
An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close