Benjamin Bergougnoux

ORCID

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 36

Top Venues

CoRR

Algorithmica

ESA

University of Clermont Auvergne, Clermont-Ferrand, France (PHD)

Education History

University of Clermont Auvergne, Clermont-Ferrand, France

PHD

Publications

Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS (2023)
Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
Enumerating minimal solution sets for metric graph problems. CoRR (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG (2023)
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC (2023)
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. CoRR (2023)
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT (2023)
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR (2023)
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
A logic-based algorithmic meta-theorem for mim-width. SODA (2023)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
Recognition of Linear and Star Variants of Leaf Powers is in P. WG (2022)
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
A logic-based algorithmic meta-theorem for mim-width. CoRR (2022)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR (2022)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84 (5) (2022)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR (2021)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
On Alternative Models for Leaf Powers. CoRR (2021)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83 (5) (2021)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT (2021)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 35 (3) (2021)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC (2020)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG (2020)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR (2020)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82 (6) (2020)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA (2019)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782 (2019)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
-acyclic hypergraphs. J. Comput. Syst. Sci. 101 (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR (2018)
Thomas Bellitto, Benjamin Bergougnoux
On Minimum Connecting Transition Sets in Graphs. WG (2018)
Thomas Bellitto, Benjamin Bergougnoux
On Minimum Connecting Transition Sets in Graphs. CoRR (2018)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR (2018)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS (2017)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR (2017)

Benjamin Bergougnoux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benjamin Bergougnoux