Benjamin Bergougnoux

50 papers A* 3A 4B 12Journal 30

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. SODA Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2026	J	`jnl`	Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard. Theor. Comput. Sci. Benjamin Bergougnoux, Lars Jaffke
2025	J	`jnl`	A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. CoRR Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2025	J	`jnl`	Enumerating Minimal Solution Sets for Metric Graph Problems. Algorithmica Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2025	B	`conf`	Hamiltonicity Parameterized by Mim-Width Is (Indeed) Para-NP-Hard. IPEC Benjamin Bergougnoux, Lars Jaffke
2025	J	`jnl`	Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard. CoRR Benjamin Bergougnoux, Lars Jaffke
2025	A*	`conf`	Mim-Width Is paraNP-Complete. ICALP Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025	J	`jnl`	Mim-Width is paraNP-complete. CoRR Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025	A	`conf`	On Algorithmic Applications of ℱ-Branchwidth. ESA Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima
2025	J	`jnl`	On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. J. Comput. Syst. Sci. Benjamin Bergougnoux, Nello Blaser, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Emmanuel Sam
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2024	B	`conf`	Enumerating Minimal Solution Sets for Metric Graph Problems. WG Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2024	J	`jnl`	Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2023	A*	`conf`	A logic-based algorithmic meta-theorem for mim-width. SODA Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
2023	J	`jnl`	Enumerating minimal solution sets for metric graph problems. CoRR Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2023	B	`conf`	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
2023	J	`jnl`	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. CoRR Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
2023	B	`conf`	New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
2023	J	`jnl`	New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	B	`conf`	Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2023	J	`jnl`	Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2023	A	`conf`	Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
2022	J	`jnl`	A logic-based algorithmic meta-theorem for mim-width. CoRR Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
2022	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2022	B	`conf`	Recognition of Linear and Star Variants of Leaf Powers is in P. WG Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
2022	J	`jnl`	Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
2021	J	`jnl`	More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2021	J	`jnl`	On Alternative Models for Leaf Powers. CoRR Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
2021	B	`conf`	On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2020	J	`jnl`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2020	B	`conf`	Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020	J	`jnl`	Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020	B	`conf`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2019	J	`jnl`	Counting minimal transversals of J. Comput. Syst. Sci. Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2019	J	`jnl`	Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2019	—	`—`	Matrix decompositions and algorithmic applications to (hyper)graphs. (Décomposition de matrices et applications algorithmiques aux (hyper)graphes). Benjamin Bergougnoux
2019	A	`conf`	More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA Benjamin Bergougnoux, Mamadou Moustapha Kanté
2019	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2018	J	`jnl`	Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2018	J	`jnl`	More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté
2018	B	`conf`	On Minimum Connecting Transition Sets in Graphs. WG Thomas Bellitto, Benjamin Bergougnoux
2018	J	`jnl`	On Minimum Connecting Transition Sets in Graphs. CoRR Thomas Bellitto, Benjamin Bergougnoux
2017	B	`conf`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté
2017	B	`conf`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan