Recherche

GT AlgoDist, «Lower Bound for Constant-Size Local Certification», Jonathan Narboni

Jonathan Narboni Title: Lower Bound for Constant-Size Local Certification Abstract: Given a network property or a data structure, a local

[gt.go] - "Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching" by František Kardoš

/Exposé en anglais/Talk in english/ Let G be a bridgeless cubic graph. The Berge-Fulkerson Conjecture (1970s) states that G admits a list of six

[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