Ambroise Baril

According to our database, Ambroise Baril authored at least 10 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings.

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist

Theory Comput. Syst., March, 2026

New perspectives on semiring applications to dynamic programming.

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist

Discret. Appl. Math., 2026

2025

La confiance de Mistral-7B est-elle justifiée ? Une évaluation en auto-estimation pour les questions biomédicales.

Laura Zanella, Ambroise Baril

Proceedings of the Actes des 32ème Conférence sur le Traitement Automatique des Langues Naturelles, 2025

2024

Fine-Grained and Parameterized Complexity of Graph Coloring Problems. (Complexité fine et paramétrée des problèmes de coloriage de graphe).

Ambroise Baril

PhD thesis, 2024

On the parameterized complexity of non-hereditary relaxations of clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

Theor. Comput. Sci., 2024

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture.

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist

CoRR, 2024

2023

On the Parameterized Complexity of Relaxations of Clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

CoRR, 2023

2022

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations.

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist

CoRR, 2022

An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems.

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist

Proceedings of the 52nd IEEE International Symposium on Multiple-Valued Logic, 2022

2021

Hardness and tractability of the <i>γ</i>-Complete Subgraph problem.

Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh

Inf. Process. Lett., 2021