Recherche
/Exposé /Talk/ The irregularity strength s(G) of a graph G is the smallest k such that the edges of G can be labelled with 1,...,k so that no two
/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
Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs
/Exposé en anglais/Talk in english/ The Alon-Jaeger-Tarsi conjecture states that for any finite field F of size at least 4 and any nonsingular matrix
Real-time Operating Systems (RTOSs) are widely used to design and develop embedded safety critical software applications. Such applications have to be
/Exposé /Talk/ The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of /n/ robots, starting from a single active