Benjamin Bergougnoux | DeepAI

AI Chat

Featured Co-authors

Michał Pilipczuk
62 publications
Petr A. Golovach
55 publications
Édouard Bonnet
45 publications
Robert Ganian
39 publications
Matthias Mnich
28 publications
Jesper Nederlof
25 publications
Erik Jan van Leeuwen
24 publications
Petr Hliněný
22 publications
Lars Jaffke
22 publications
Tuukka Korhonen
21 publications
O-joung Kwon
19 publications

∙ 07/04/2023

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Twin-width is a structural width parameter introduced by Bonnet, Kim, Th...

0 Benjamin Bergougnoux, et al. ∙

∙ 07/03/2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Dynamic programming on various graph decompositions is one of the most f...

0 Benjamin Bergougnoux, et al. ∙

∙ 07/01/2023

Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves

For a given graph G, a depth-first search (DFS) tree T of G is an r-root...

0 Emmanuel Sam, et al. ∙

∙ 02/21/2023

New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth

We study the tractability of the maximum independent set problem from th...

0 Benjamin Bergougnoux, et al. ∙

∙ 10/05/2022

Tight Lower Bounds for Problems Parameterized by Rank-width

We show that there is no 2^o(k^2) n^O(1) time algorithm for Independent ...

0 Benjamin Bergougnoux, et al. ∙

∙ 02/27/2022

A logic-based algorithmic meta-theorem for mim-width

We introduce a logic called distance neighborhood logic with acyclicity ...

0 Benjamin Bergougnoux, et al. ∙

∙ 05/26/2021

On Alternative Models for Leaf Powers

A fundamental problem in computational biology is the construction of ph...

0 Benjamin Bergougnoux, et al. ∙

∙ 05/25/2021

On Dasgupta's hierarchical clustering objective and its relation to other graph parameters

The minimum height of vertex and edge partition trees are well-studied g...

0 Svein Høgemo, et al. ∙

∙ 07/28/2020

Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

The Cut Count technique and the rank-based approach have lead to sin...

0 Benjamin Bergougnoux, et al. ∙

∙ 08/15/2018

Counting Minimal Transversals of β-Acyclic Hypergraphs

We prove that one can count in polynomial time the number of minimal tra...

0 Benjamin Bergougnoux, et al. ∙

∙ 07/23/2018

On Minimum Connecting Transition Sets in Graphs

A forbidden transition graph is a graph defined together with a set of p...

0 Thomas Bellitto, et al. ∙

∙ 05/29/2018

Rank Based Approach on Graphs with Structured Neighborhood

In this paper, we combine the rank-based approach and the neighbor-equiv...

0 Benjamin Bergougnoux, et al. ∙

∙ 07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...

0 Benjamin Bergougnoux, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world