Recherche

/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

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

*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

Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs

Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic

The cell cycle is a sequence of events by which a cell reproduces itself while preserving the integrity of its genome. This preservation property is