Fast exact algorithms for some connectivity problems parameterized by clique-width B Bergougnoux, M Kanté
Theoretical Computer Science 782, 30-53, 2019
27 2019 Node multiway cut and subset feedback vertex set on graphs of bounded mim-width B Bergougnoux, C Papadopoulos, JA Telle
Algorithmica 84 (5), 1385-1417, 2022
24 2022 Towards a polynomial kernel for directed feedback vertex set B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan
Algorithmica 83, 1201-1221, 2021
24 2021 More applications of the d-neighbor equivalence: Connectivity and acyclicity constraints B Bergougnoux, MM Kanté
27th Annual European Symposium on Algorithms (ESA 2019), 2019
21 2019 A logic-based algorithmic meta-theorem for mim-width B Bergougnoux, J Dreier, L Jaffke
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
19 2023 More Applications of the -Neighbor Equivalence: Acyclicity and Connectivity Constraints B Bergougnoux, MM Kanté
SIAM Journal on Discrete Mathematics 35 (3), 1881-1926, 2021
19 2021 An optimal XP algorithm for hamiltonian cycle on graphs of bounded clique-width B Bergougnoux, MM Kanté, O Kwon
Algorithmica 82 (6), 1654-1674, 2020
14 2020 Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth B Bergougnoux, É Bonnet, N Brettell, O Kwon
arXiv preprint arXiv:2007.14179, 2020
13 2020 Matrix decompositions and algorithmic applications to (hyper) graphs B Bergougnoux
Université Clermont Auvergne [2017-2020], 2019
8 2019 New width parameters for independent set: One-sided-mim-width and neighbor-depth B Bergougnoux, T Korhonen, I Razgon
International Workshop on Graph-Theoretic Concepts in Computer Science, 72-85, 2023
7 2023 Rank based approach on graphs with structured neighborhood B Bergougnoux, MM Kanté
CoRR, abs/1805.11275, 2018
6 2018 Tight lower bounds for problems parameterized by rank-width B Bergougnoux, T Korhonen, J Nederlof
arXiv preprint arXiv:2210.02117, 2022
5 2022 On minimum connecting transition sets in graphs T Bellitto, B Bergougnoux
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
4 2018 Recognition of linear and star variants of leaf powers is in P B Benjamin, S Høgemo, JA Telle, M Vatshelle
International Workshop on Graph-Theoretic Concepts in Computer Science, 70-83, 2022
2 2022 Counting minimal transversals of β-acyclic hypergraphs B Bergougnoux, F Capelli, MM Kanté
Journal of Computer and System Sciences 101, 21-30, 2019
2 2019 Enumerating minimal solution sets for metric graph problems B Bergougnoux, O Defrain, FM Inerney
arXiv preprint arXiv:2309.17419, 2023
1 2023 On dasgupta’s hierarchical clustering objective and its relation to other graph parameters S Høgemo, B Bergougnoux, U Brandes, C Paul, JA Telle
Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021 …, 2021
1 2021 Erratum: More Applications of the -Neighbor Equivalence: Acyclicity and Connectivity Constraints B Bergougnoux, MM Kanté
SIAM Journal on Discrete Mathematics 38 (1), 1191-1192, 2024
2024 Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves E Sam, B Bergougnoux, PA Golovach, N Blaser
International Symposium on Fundamentals of Computation Theory, 392-405, 2023
2023 Sparse Graphs of Twin-width 2 Have Bounded Tree-width B Bergougnoux, J Gajarský, G Guśpiel, P Hliněný, F Pokrývka, ...
arXiv preprint arXiv:2307.01732, 2023
2023