Scholar
Édouard Bonnet
Google Scholar ID: ZuMwHVAAAAAJ
ENS Lyon, LIP, France
algorithms
complexity
graphs
geometry
games
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
2,002
H-index
23
i10-index
50
Publications
20
Co-authors
13
list available
Contact
CV
Open ↗
Publications
22 items
Arc Kayles is PSPACE-complete
2026
Cited
0
Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
2026
Cited
0
Time-Optimal APSP and Matrix Multiplication in Classes of Linear Neighborhood Complexity
2026
Cited
0
Large Finite Point Sets Have 4 Collinear Points or a 6-Clique
2026
Cited
0
Tight Inapproximability of Max Independent Set in Triangle-Free Graphs
2026
Cited
0
Faster Parameterized Broadcasting
2026
Cited
0
Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width
2026
Cited
0
Moderately beyond clique-width: reduced component max-leaf and related parameters
2026
Cited
0
Load more
Co-authors
11 total
Eun Jung Kim
KAIST, CNRS
Florian Sikora
LAMSADE, Université Paris-Dauphine
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Dániel Marx
CISPA Helmholtz Center for Information Security
Abdallah Saffidine
Lecturer, the University of New South Wales
O-joung Kwon
Hanyang University
Michael Lampis
LAMSADE, Université Paris Dauphine
Nick Brettell
Victoria University of Wellington
