Recherche

Colette Johnen (LaBRI) Title: From Static Stabilization to Dynamic Stabilization in case of bounded recurrent edges Abstract: We consider the problem

We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from

Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal

In automated learning problems, the task is to find a model that maps given inputs to their corresponding outputs as accurately as possible. Over the

Titre: "ON ROBUSTNESS FOR THE SKOLEM and related PROBLEMS" Blaise Genest (IPAL, Singapore) abstract: The Skolem problem is a long-standing open

[Soutenance en anglais/Talk in english] Cette thèse traite des questions structurelles de la théorie des graphes qui découlent de motivations