Benjamin Bergougnoux

According to our database, Benjamin Bergougnoux authored at least 22 papers between 2017 and 2023.

Collaborative distances:

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

2023

Enumerating minimal solution sets for metric graph problems.

Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney

CoRR, 2023

New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth.

Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Tight Lower Bounds for Problems Parameterized by Rank-Width.

Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

A logic-based algorithmic meta-theorem for mim-width.

Benjamin Bergougnoux, Jan Dreier, Lars Jaffke

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.

Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.

Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

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

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width.

Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle

Algorithmica, 2022

Recognition of Linear and Star Variants of Leaf Powers is in P.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

SIAM J. Discret. Math., 2021

On Alternative Models for Leaf Powers.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

CoRR, 2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set.

Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Algorithmica, 2021

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

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2020

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth.

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

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

Benjamin Bergougnoux

PhD thesis, 2019

Fast exact algorithms for some connectivity problems parameterized by clique-width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Theor. Comput. Sci., 2019

Counting minimal transversals of <i>β</i>-acyclic hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

J. Comput. Syst. Sci., 2019

More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Counting Minimal Transversals of β-Acyclic Hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

CoRR, 2018

On Minimum Connecting Transition Sets in Graphs.

Thomas Bellitto, Benjamin Bergougnoux

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Fast exact algorithms for some connectivity problems parametrized by clique-width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

CoRR, 2017