Benjamin Bergougnoux
Publications
Publications
|
|
Space-Efficient Parameterized Algorithms on Graphs of Low ShrubdepthACM Transactions on Computation Theory, 2025, ⟨10.1145/3723880⟩ |
|
|
Enumerating minimal solution sets for metric graph problemsAlgorithmica, 2023, 87 (5), pp.712-735. ⟨10.1007/s00453-025-01300-4⟩ |
|
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-WidthAlgorithmica, 2020, 82 (6), pp.1654-1674. ⟨10.1007/s00453-019-00663-9⟩ |
|
|
Counting Minimal Transversals of β-Acyclic HypergraphsJournal of Computer and System Sciences, 2019, ⟨10.1016/j.jcss.2018.10.002⟩ |
|
|
Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-HardInternational Symposium on Parameterized and Exact Computation (IPEC), Sep 2025, Varsovie, Poland |
|
|
Mim-Width Is paraNP-Complete52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.25⟩ |
|
|
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial SpaceSymposium on Discrete Algorithms (SODA26), Jan 2026, Vancouver, Canada |
On Algorithmic Applications of ℱ-BranchwidthEuropean Symposium on Algorithms (ESA), Sep 2025, Varsovie, Poland. ⟨10.4230/LIPIcs.ESA.2025.16⟩ |
|
|
|
On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph ParametersFCT 2021 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩ |
|
|
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidthIPEC 2020, Dec 2020, Hong Kong, China |
|
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-WidthWADS 2017, Jul 2017, St. John’s, Canada |
|
|
Towards a Polynomial Kernel For Directed Feedback Vertex Set42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.36⟩ |
|
|
More applications of the $d$-neihgbor equivalence: acyclicity and connectivity constraints2019 |
|
|
Counting Minimal Transversals of ß-Acyclic Hypergraphs2018 |
|
|
On Minimum Connecting Transition Sets in Graphs2018 |
|
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.2018 |
|
|
Fast exact algorithms for some connectivity problems parametrized by clique-width2017 |