Recherche

Ralf Klasing (LaBRI) Title: Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems Abstract: Finding a maximum-weight

/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/ Given n points in the plane, a spanning tree is a set of n-1 straight line edges connecting them while inducing a

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

Verifying Liveness Properties under Weak Memory Models I will discuss verifying liveness properties for concurrent programs running on weak memory

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

Age-related macular degeneration (AMD) is one of the leading causes of legal blindness worldwide. However, manual screening of the retina for

Detecting and Explaining Privacy Risks on Temporal Data Speaker: Marie-Christine Rousset, Professor at University of Grenoble Abstract: Personal data