Fast exact algorithms for some connectivity problems parametrized by clique-width. - Benjamin Bergougnoux; Mamadou Moustapha Kanté (CoRR, 2017)

On Minimum Connecting Transition Sets in Graphs. - Thomas Bellitto; Benjamin Bergougnoux (WG, 2018)

Counting Minimal Transversals of β-Acyclic Hypergraphs. - Benjamin Bergougnoux; Florent Capelli; Mamadou Moustapha Kanté (CoRR, 2018)

More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. - Benjamin Bergougnoux; Mamadou Moustapha Kanté (ESA, 2019)

Counting minimal transversals of β-acyclic hypergraphs. - Benjamin Bergougnoux; Florent Capelli; Mamadou Moustapha Kanté (J. Comput. Syst. Sci., 2019)

Fast exact algorithms for some connectivity problems parameterized by clique-width. - Benjamin Bergougnoux; Mamadou Moustapha Kanté (Theor. Comput. Sci., 2019)

Matrix decompositions and algorithmic applications to (hyper)graphs. (Décomposition de matrices et applications algorithmiques aux (hyper)graphes). - Benjamin Bergougnoux (2019)

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. - Benjamin Bergougnoux; Édouard Bonnet; Nick Brettell; O-joung Kwon (IPEC, 2020)

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. - Benjamin Bergougnoux; Mamadou Moustapha Kanté; O-joung Kwon (Algorithmica, 2020)

On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. - Svein Høgemo; Benjamin Bergougnoux; Ulrik Brandes; Christophe Paul; Jan Arne Telle (FCT, 2021)

Towards a Polynomial Kernel for Directed Feedback Vertex Set. - Benjamin Bergougnoux; Eduard Eiben; Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

On Alternative Models for Leaf Powers. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (CoRR, 2021)

More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. - Benjamin Bergougnoux; Mamadou Moustapha Kanté (SIAM J. Discret. Math., 2021)

Recognition of Linear and Star Variants of Leaf Powers is in P. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (WG, 2022)

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. - Benjamin Bergougnoux; Charis Papadopoulos; Jan Arne Telle (Algorithmica, 2022)

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 (ESA, 2023)

Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. - Emmanuel Sam; Benjamin Bergougnoux; Petr A. Golovach; Nello Blaser (FCT, 2023)

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. - Benjamin Bergougnoux; Jakub Gajarský; Grzegorz Guspiel; Petr Hlinený; Filip Pokrývka; Marek Sokolowski 001 (ISAAC, 2023)

A logic-based algorithmic meta-theorem for mim-width. - Benjamin Bergougnoux; Jan Dreier; Lars Jaffke (SODA, 2023)

Tight Lower Bounds for Problems Parameterized by Rank-Width. - Benjamin Bergougnoux; Tuukka Korhonen; Jesper Nederlof (STACS, 2023)

New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. - Benjamin Bergougnoux; Tuukka Korhonen; Igor Razgon (WG, 2023)

Erratum: More Applications of the (d )-Neighbor Equivalence: Acyclicity and Connectivity Constraints. - Benjamin Bergougnoux; Mamadou Moustapha Kanté (SIAM J. Discret. Math., 2024)

Mim-Width Is paraNP-Complete. - Benjamin Bergougnoux; Édouard Bonnet; Julien Duron (ICALP, 2025)

On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. - Benjamin Bergougnoux; Nello Blaser; Michael R. Fellows; Petr A. Golovach; Frances A. Rosamond; Emmanuel Sam (J. Comput. Syst. Sci., 2025)

Enumerating Minimal Solution Sets for Metric Graph Problems. - Benjamin Bergougnoux; Oscar Defrain; Fionn Mc Inerney (Algorithmica, 2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard. - Benjamin Bergougnoux; Lars Jaffke (CoRR, 2025)