Benjamin Bergougnoux
Scholar

Benjamin Bergougnoux

Google Scholar ID: m-TtvNoAAAAJ
Aix Marseille Université
Parameterized complexitywidth parametersalgorithmic meta-theorem
Citations & Impact
All-time
Citations
247
 
H-index
9
 
i10-index
9
 
Publications
20
 
Co-authors
0
 
Contact
Resume (English only)
Academic Achievements
  • Publications: 'A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space' (with V. Chekan and G. Stamoulis), accepted at SODA 2026; 'On Algorithmic Applications of F-Branchwidth' (with T. Hamm, P. T. Lima, and L. Jaffke), accepted at ESA 2025.
Research Experience
  • Currently an associate professor at Aix-Marseille University, member of the COALA team, part of the LIS laboratory; Previously a postdoc for two years at the University of Warsaw and three years at the University of Bergen.
Education
  • PhD Degree: Obtained in February 2019 from Université Clermont Auvergne.
Background
  • Research Interests: Theoretical Computer Science, particularly in the tractability of NP-hard problems under structural restrictions; Professional Field: Parameterized complexity, focusing on efficient algorithms for width parameters such as tree-width, clique-width, rank-width, and mim-width.
Co-authors
0 total
Co-authors: 0 (list not available)