Recherche
/Exposé en anglais/Talk in english/ A rainbow matching in an edge-coloured graph is a matching whose edges all have different colours. Let G be a
We aim at designing both theoretically and experimentally methods for the automatic detection of potential bugs in software – or the proof of the
We are interested in tools for synthesizing strategies in timed games with parity objective. From a theoretical point of view, we define and interpret
Quantum physics and chemistry have provided well-recognized theoretical tools to predict the behavior of molecules and materials described by the
/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
/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
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that