Benjamin Bergougnoux

Available identifiers

zbMath Open bergougnoux.benjaminMaRDI QIDQ1627150

List of research outcomes

Publication	Date of Publication	Type
Space-efficient parameterized algorithms on graphs of low shrubdepth	2025-01-06	Paper
Tight lower bounds for problems parameterized by rank-width	2024-10-08	Paper
Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves	2024-05-29	Paper
A logic-based algorithmic meta-theorem for mim-width	2024-05-14	Paper
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth	2024-05-03	Paper
Erratum to: ``More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints	2024-04-23	Paper
Enumerating minimal solution sets for metric graph problems	2023-09-29	Paper
Sparse Graphs of Twin-width 2 Have Bounded Tree-width	2023-07-04	Paper
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters	2022-05-20	Paper
https://portal.mardi4nfdi.de/entity/Q5075752	2022-05-11	Paper
Node multiway cut and subset feedback vertex set on graphs of bounded mim-width	2022-05-03	Paper
More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints	2021-08-20	Paper
Towards a polynomial kernel for directed feedback vertex set	2021-04-19	Paper
Towards a polynomial kernel for directed feedback vertex set	2020-05-26	Paper
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width	2020-04-14	Paper
Fast exact algorithms for some connectivity problems parameterized by clique-width	2019-06-06	Paper
Counting minimal transversals of \(\beta\)-acyclic hypergraphs	2019-01-25	Paper
On minimum connecting transition sets in graphs	2018-11-22	Paper
On Minimum Connecting Transition Sets in Graphs	2018-07-23	Paper
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width	2017-09-22	Paper

Research outcomes over time

This page was built for person: Benjamin Bergougnoux