Menu Close

UTMA

Unifying Theories for Multivariate Algorithms (ANR-DFG project, ANR-20-CE92-0027) Studying the tractability of computational problems is a core challenge in theoretical computer science. A central question

ESIGMA

Efficiency and Structure in Graph Mining Application (ANR-17-CE23-0010). As a general modelling tool, graphs are gaining increasing attention. They capture the interactions of entities in…

DEMOGRAPH

Decomposition of graphical models (ANR-16-CE40-0028) Solving NP-hard problems is still a challenge at the theoretical or practical level. This project aims at solving decision, optimization…

JNIM 2017

Les Journées Nationales du GDR Informatique Mathématique (JNIM) sont un lieu d’information et d’échange annuel entre chercheurs de la discipline. Les JNIM 2017 étaient organisées…

GROW 2015

The 7th workshop on Graph Classes, Optimization, and Width Parameters (GROW 2015) was held in Aussois, in the french Alps, from October 11 to October 15,…

KERNEL

KERNEL (Languedoc-Roussillon Regional grant “chercheur d’avenir) Massive datas arise from most of the scientific disciplines, including biology, physics, environmental and health science… To handle the…

GRAPH MODIFICATION

Efficient algorithms for graph modification problems (AURORA French-Norwegian project) Despite the simplicity of their definition, graphs are fundamental objects for computer science. On one side,…