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
13 items
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
2026
Cited
0
Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
2026
Cited
0
Coloring Hardness on Low Twin-Width Graphs
2025
Cited
0
Excluding a Forest Induced Minor
2025
Cited
0
Separator Theorem for Minor-Free Graphs in Linear Time
2025
Cited
0
Treedepth Inapproximability and Exponential ETH Lower Bound
2025
Cited
0
Separability Properties of Monadically Dependent Graph Classes
2025
Cited
0
Every Graph is Essential to Large Treewidth
2025
Cited
0
Load more
Resume (English only)
Co-authors
13 total
Eun Jung Kim
KAIST, CNRS
Co-author 2
Co-author 3
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Co-author 5
Dániel Marx
CISPA Helmholtz Center for Information Security
Co-author 7
O-joung Kwon
Hanyang University
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up