'Edouard Bonnet

collaborators

2 papers

cs.DS2026

Faster Parameterized Broadcasting

Ãdouard Bonnet, Carl Feghali, Manolis Vasilakis

Given a connected graph $G$ and a source $s \in V (G)$ , what is the smallest number of rounds necessary for all vertices of $G$ to receive a message initially only held by $s$ , wher…

cs.CC2026

Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width

Ãdouard Bonnet, MaÃ«l Dumas, Julien Duron

For every $ε > 0$ , Max Independent Set admits a polynomial-time $n^{ε}$ -approximation algorithm on $n$ -vertex graphs of effectively bounded twin-width [BergÃ© et…