| 2026 | SODA | A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. | Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis |
| 2026 | WG | Tight Bounds for Some W[1]-Hard Problems Parameterized by Multi-Clique-Width. | Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch |
| 2025 | ESA | On Algorithmic Applications of ℱ-Branchwidth. | Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima |
| 2025 | ICALP | Mim-Width Is paraNP-Complete. | Benjamin Bergougnoux, douard Bonnet, Julien Duron |
| 2024 | WG | Enumerating Minimal Solution Sets for Metric Graph Problems. | Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney |
| 2023 | ESA | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. | Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2023 | FCT | Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. | Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser |
| 2023 | ISAAC | Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. | Benjamin Bergougnoux, Jakub Gajarsk, Grzegorz Guspiel, Petr Hlinen, Filip Pokrvka, Marek Sokolowski |
| 2023 | SODA | A logic-based algorithmic meta-theorem for mim-width. | Benjamin Bergougnoux, Jan Dreier, Lars Jaffke |
| 2023 | STACS | Tight Lower Bounds for Problems Parameterized by Rank-Width. | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
| 2023 | WG | New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
| 2022 | WG | Recognition of Linear and Star Variants of Leaf Powers is in P. | Benjamin Bergougnoux, Svein Hgemo, Jan Arne Telle, Martin Vatshelle |
| 2021 | FCT | On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. | Svein Hgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle |
| 2020 | WG | Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. | Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle |
| 2019 | ESA | More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. | Benjamin Bergougnoux, Mamadou Moustapha Kant |
| 2018 | WG | On Minimum Connecting Transition Sets in Graphs. | Thomas Bellitto, Benjamin Bergougnoux |
| 2017 | MFCS | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | WADS | An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. | Benjamin Bergougnoux, Mamadou Moustapha Kant, O-joung Kwon |