Recherche

[gt.go] - "A tight local algorithm for the minimum dominating set problem in > outerplanar graphs" and "Limiting crossing numbers" by Alexandra Wesole

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

[MTV] Mathieu Hilaire (LaBRI) - Serializability in Parametric Timed Automata, Resilience and Home-Space for WSTS

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

[M2F] Gabriel Bathie - "LTL Learning meets Boolean Set Cover: enumerative algorithms for program synthesis"

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

GT algodist - Kernelizing Temporal Exploration Problems, Petra Wolf

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

Seminaire SYNTHESE, Blaise Genest

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

Guide d'accès aux ressources documentaires (BMI/BUST et accès en ligne)

Ce guide s'adresse d'abord aux étudiants et (nouveaux) chercheurs du LaBRI pour leur donner les points d'accès principaux aux ressources documentaires

[soutenance de thèse] - "Structure de Graphes, Mineurs et Arbres Induits / Structure of Graphs: Minors and Induced Trees" par Claire Hilaire

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