Recherche
/Exposé /Talk/ The chromatic number and clique number are well-studied notions that have motivated a significant part of the research in graph theory
Wolfgang-OP: A Robust Humanoid Robot Platform for Research and Competitions Jasper Güldenstein Visio: https://u-bordeaux-fr.zoom.us/j/83483228567
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
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 propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Chana Weil-Kennedy (CEA List) Title: Parameterized Verification of Distributed Systems Abstract: I am interested in verification of distributed
/Exposé en français/Talk in french / Transparents en anglais/English slides/ In this talk, I will given a rather simple construction of a graph U n