Recherche

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

/Exposé en anglais/Talk in english/ Let G be a bridgeless cubic graph. The Berge-Fulkerson Conjecture (1970s) states that G admits a list of six

Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [Note: no quantum background is needed to attend this talk] Quantum

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

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

Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However

/Exposé /Talk/ Recent developments in the intersection of structural graph theory, parameterized algorithms, and finite model theory have provided

/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the