Recherche
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
/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
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs
*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity
/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type
Ralf Klasing (LaBRI) Title: Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems Abstract: Finding a maximum-weight
Chana Weil-Kennedy (CEA List) Title: Parameterized Verification of Distributed Systems Abstract: I am interested in verification of distributed