Benjamin Bergougnoux I am a postdoc at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw.

Identifiants chercheurs

IdHAL :

benjamin-bergougnoux

ORCID :

0000-0002-6270-3663

arXiv :

bergougnoux_b_1

Publications

Article dans une revue (4)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux,Vera Chekan,Robert Ganian,Mamadou Moustapha Kanté,Matthias Mnichet al. ACM Transactions on Computation Theory, 2025, ⟨10.1145/3723880⟩ Article dans une revue hal-04492602v1
Enumerating minimal solution sets for metric graph problems Benjamin Bergougnoux,Oscar Defrain,Fionn Mc Inerney Algorithmica, 2023, 87 (5), pp.712-735. ⟨10.1007/s00453-025-01300-4⟩ Article dans une revue hal-04502310v1
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width Benjamin Bergougnoux,Mamadou Moustapha Kanté,O-Joung Kwon Algorithmica, 2020, 82 (6), pp.1654-1674. ⟨10.1007/s00453-019-00663-9⟩ Article dans une revue hal-04056459v1
Counting Minimal Transversals of β-Acyclic Hypergraphs Benjamin Bergougnoux,Florent Capelli,Mamadou Moustapha Kanté Journal of Computer and System Sciences, 2019, ⟨10.1016/j.jcss.2018.10.002⟩ Article dans une revue hal-01923090v1

Communication dans un congrès (8)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard Benjamin Bergougnoux,Lars Jaffke International Symposium on Parameterized and Exact Computation (IPEC), Sep 2025, Varsovie, Poland Communication dans un congrès hal-05353737v1
Mim-Width Is paraNP-Complete Benjamin Bergougnoux,Édouard Bonnet,Julien Duron 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.25⟩ Communication dans un congrès hal-05353772v1
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space Benjamin Bergougnoux,Vera Chekan,Giannos Stamoulis Symposium on Discrete Algorithms (SODA26), Jan 2026, Vancouver, Canada Communication dans un congrès hal-05353750v1
On Algorithmic Applications of ℱ-Branchwidth Benjamin Bergougnoux,Thekla Hamm,Lars Jaffke,Paloma Lima European Symposium on Algorithms (ESA), Sep 2025, Varsovie, Poland. ⟨10.4230/LIPIcs.ESA.2025.16⟩ Communication dans un congrès hal-05353724v1
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 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩ Communication dans un congrès lirmm-03867040v1
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth Benjamin Bergougnoux,Édouard Bonnet,Nick Brettell,O-Joung Kwon IPEC 2020, Dec 2020, Hong Kong, China Communication dans un congrès hal-03430381v1
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width Benjamin Bergougnoux,O-Joung Kwon,Mamadou Moustapha Kanté WADS 2017, Jul 2017, St. John’s, Canada Communication dans un congrès hal-01590820v1
Towards a Polynomial Kernel For Directed Feedback Vertex Set Benjamin Bergougnoux,Eduard Eiben,Robert Ganian,Sebastian Ordyniak,M S Ramanujan 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.36⟩ Communication dans un congrès hal-01759637v1

Pré-publication, Document de travail (5)

More applications of the $d$-neihgbor equivalence: acyclicity and connectivity constraints Benjamin Bergougnoux,Mamadou Moustapha Kanté 2019 Pré-publication, Document de travail hal-01799573v5
On Minimum Connecting Transition Sets in Graphs Thomas Bellitto,Benjamin Bergougnoux 2018 Pré-publication, Document de travail hal-01846961v2
Counting Minimal Transversals of ß-Acyclic Hypergraphs Benjamin Bergougnoux,Florent Capelli,Mamadou Moustapha Kanté 2018 Pré-publication, Document de travail hal-01610959v2
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Benjamin Bergougnoux,Mamadou Moustapha Kanté,O-Joung Kwon 2018 Pré-publication, Document de travail hal-01858180v1
Fast exact algorithms for some connectivity problems parametrized by clique-width Benjamin Bergougnoux,Mamadou Moustapha Kanté 2017 Pré-publication, Document de travail hal-01560555v2