É
Édouard Bonnet
Researcher at Claude Bernard University Lyon 1
Publications - 124
Citations - 1012
Édouard Bonnet is an academic researcher from Claude Bernard University Lyon 1. The author has contributed to research in topics: Parameterized complexity & Treewidth. The author has an hindex of 12, co-authored 123 publications receiving 685 citations. Previous affiliations of Édouard Bonnet include Middlesex University & École Normale Supérieure.
Papers
More filters
Posted Content
Twin-width I: tractable FO model checking
TL;DR: It is proved that bounded twin-width is preserved by FO interpretations and transductions (allowing operations such as squaring or complementing a graph) and unifies and significantly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets.
Posted Content
Twin-width II: small classes
TL;DR: The twin-width of a graph is shown to be the minimum integer d such that it has a sequence of iterated vertex identifications for which the overall maximum number of red edges incident to a single vertex is at most $d, and the "small conjecture" that every small hereditary class has bounded twin- width is explored.
Journal ArticleDOI
On Subexponential and FPT-Time Inapproximability
TL;DR: Two complementary approaches are provided; the former makes a strong link between the linear PCP conjecture and inapproximability; the latter builds a class of equivalent problems under approximation in subexponential time.
Proceedings ArticleDOI
Twin-width I: tractable FO model checking
TL;DR: The notion of twin-width on graphs and on matrices was introduced by Guillemot and Marx as mentioned in this paper, who showed that the width invariant of a graph can be computed in polynomial time.
Proceedings Article
Twin-width II: small classes
TL;DR: Norine et al. as discussed by the authors showed that every bounded twin-width class is small, i.e., has at most n!c^n$ graphs labeled by n, for some constant c.