Recherche

Age-related macular degeneration (AMD) is one of the leading causes of legal blindness worldwide. However, manual screening of the retina for

Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the

/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

Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [Note: no quantum background is needed to attend this talk] Quantum

We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by

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

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

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 en anglais/Talk in english] Cette thèse traite des questions structurelles de la théorie des graphes qui découlent de motivations