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
Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with
In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph
Jonathan Narboni Title: Lower Bound for Constant-Size Local Certification Abstract: Given a network property or a data structure, a local
/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