Recherche
/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core
Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a
/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Mouna Safir (ENS Lyon) Title: Self-Stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter Abstract: We consider distributed