Recherche
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
/Exposé en anglais/Talk in english/ In 1974, Erdős posed the following problem. Given an oriented graph H, determine or estimate the maximum possible
/Exposé en anglais/Talk in english/ In 1974, Erdős posed the following problem. Given an oriented graph H, determine or estimate the maximum possible
/Exposé en anglais/Talk in english/ Tree decompositions are a powerful tool in structural graph theory; they are traditionally used in the context of
/Exposé en anglais/Talk in english/ Tree decompositions are a powerful tool in structural graph theory; they are traditionally used in the context of
Razvan est de l'IMB. Le projet HQI (France 2030, piloté par J.-C. Lafoucrière (CEA) Dans cet exposé, nous utilisons la présentation du projet Hybrid