Recherche

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

Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off

Séminaire TAD A Hybrid AI system for fusion of object and context information: application to the rail line defect detection Alexey Zhukov A hybrid

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

Guess Random Additive Noise Decoder (GRAND) has emerged as a noise-centric universal decoder in classical systems, enabling low-energy, low-latency

A round-table session: each person will tell in five minutes about the current research projects / interests, maybe including the wishes for starting

/Exposé en français/Talk in french / Transparents en anglais/English slides/ In this talk, I will given a rather simple construction of a graph U n

We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a

/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n

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