Recherche

/Exposé /Talk/ The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of /n/ robots, starting from a single active

Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with

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/ 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