Benjamin Bergougnoux

activity

20172025

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

2 citations · 8 across the 11 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.CC2017★ 2 cited

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

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Given a clique-width $k$ -expression of a graph $G$ , we provide $2^{O (k)} \cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted…

cs.DS2017

An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width

Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon

In this paper, we prove that, given a clique-width $k$ -expression of an $n$ -vertex graph, \textsc{Hamiltonian Cycle} can be solved in time $n^{O (k)}$ . This improves the n…