Hardness and tractability of the γ-Complete Subgraph problem. - Ambroise Baril; Riccardo Dondi; Mohammad Mehdi Hosseinzadeh (Inf. Process. Lett., 2021)

An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (ISMVL, 2022)

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (CoRR, 2022)

On the Parameterized Complexity of Relaxations of Clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (CoRR, 2023)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (CoRR, 2024)

On the parameterized complexity of non-hereditary relaxations of clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (Theor. Comput. Sci., 2024)