Recherche

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

I am interested in verification of distributed systems with an unbounded number of agents running the same finite-state program. These include systems

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

In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with

/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core