Recherche
Strong flip-flatness has emerged as a natural dense analogue of uniform almost-wideness in the context of preservation theorems, but its combinatorial
/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
In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed
Hussein Kazemi (LaBRI) Title: Trajectory visibility at first sight Abstract: Let P be a simple polygon with n vertices, and let two moving entities q
The first question when deploying a program synthesis approach is the design of the target programming language, called domain-specific language (DSL)
**Orbit-finite linear programming** An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely