Édouard Bonnet

593 total citations
27 papers, 82 citations indexed

About

Édouard Bonnet is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Édouard Bonnet has authored 27 papers receiving a total of 82 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 7 papers in Discrete Mathematics and Combinatorics and 7 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Édouard Bonnet's work include Advanced Graph Theory Research (24 papers), Complexity and Algorithms in Graphs (16 papers) and Computational Geometry and Mesh Generation (7 papers). Édouard Bonnet is often cited by papers focused on Advanced Graph Theory Research (24 papers), Complexity and Algorithms in Graphs (16 papers) and Computational Geometry and Mesh Generation (7 papers). Édouard Bonnet collaborates with scholars based in France, United Kingdom and Slovenia. Édouard Bonnet's co-authors include Vangélis Th. Paschos, Stéphan Thomassé, Eun Jung Kim, Bruno Escoffier, Michael Lampis, Tillmann Miltzow, Florian Sikora, Abdallah Saffidine, Bruno Escoffier and Pierre Simon and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Édouard Bonnet

20 papers receiving 77 citations

Peers

Édouard Bonnet

CTM

DMC

CNC

CGCD

Bartosz Walczak Poland

Paweł Rzążewski Poland

Mamadou Moustapha Kanté France

Dor Minzer United States

Johan Thapper France

Steven Chaplick Germany

Szymon Toruńczyk Poland

Shai Gutner Israel

Neil Thapen Czechia

Barnaby Martin United Kingdom

Bartosz Walczak Poland

Édouard Bonnet

87 ×1.4

CTM

42 ×2.2

DMC

9 ×0.6

CNC

15 ×1.0

27 ×2.7

CGCD

Citations per year, relative to Édouard Bonnet Édouard Bonnet (= 1×) peers Bartosz Walczak

Countries citing papers authored by Édouard Bonnet

Since Specialization

Citations

This map shows the geographic impact of Édouard Bonnet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Édouard Bonnet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Édouard Bonnet more than expected).

Fields of papers citing papers by Édouard Bonnet

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Édouard Bonnet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Édouard Bonnet. The network helps show where Édouard Bonnet may publish in the future.

Co-authorship network of co-authors of Édouard Bonnet

This figure shows the co-authorship network connecting the top 25 collaborators of Édouard Bonnet. A scholar is included among the top collaborators of Édouard Bonnet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Édouard Bonnet. Édouard Bonnet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bonamy, Marthe, et al.. (2024). Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. Journal of Combinatorial Theory Series B. 167. 215–249. 1 indexed citations

Bonnet, Édouard, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, & Stéphan Thomassé. (2024). Twin-width and permutations. Logical Methods in Computer Science. Volume 20, Issue 3.

Bodlaender, Hans L., Édouard Bonnet, Dušan Knop, et al.. (2023). Treewidth Is NP-Complete on Cubic Graphs. IT University Of Copenhagen (IT University of Copenhagen).

Bonnet, Édouard, et al.. (2023). Neighbourhood complexity of graphs of bounded twin-width. European Journal of Combinatorics. 115. 103772–103772. 3 indexed citations

Bonnet, Édouard, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, & Stéphan Thomassé. (2023). Twin-width and permutations. arXiv (Cornell University). 156–162. 1 indexed citations

Bonnet, Édouard, et al.. (2022). Twin-width and Polynomial Kernels. Algorithmica. 84(11). 3300–3337. 12 indexed citations

Bonnet, Édouard, et al.. (2020). The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica. 83(5). 1165–1200. 2 indexed citations

Bonnet, Édouard, et al.. (2020). The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica. 82(10). 3018–3040. 2 indexed citations

Bonnet, Édouard & Tillmann Miltzow. (2020). Parameterized Hardness of Art Gallery Problems. ACM Transactions on Algorithms. 16(4). 1–23. 4 indexed citations

10.

Bonnet, Édouard & Paweł Rzążewski. (2019). Optimality Program in Segment and String Graphs. Algorithmica. 81(7). 3047–3073.

11.

Bonnet, Édouard, et al.. (2019). Parameterized Complexity of Independent Set in H-Free Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

12.

Bonnet, Édouard, et al.. (2018). Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. Middlesex University Research Repository (Middlesex University Of London).

13.

Bonnet, Édouard, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, & Florian Sikora. (2018). QPTAS and subexponential algorithm for maximum clique on disk graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15.

14.

Bonnet, Édouard, et al.. (2018). EPTAS for Max Clique on Disks and Unit Balls. arXiv (Cornell University). 568–579. 2 indexed citations

15.

Bonnet, Édouard, Panos Giannopoulos, & Michael Lampis. (2017). On the Parameterized Complexity of Red-Blue Points Separation. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

16.

Bonnet, Édouard, Michael Lampis, & Vangélis Th. Paschos. (2017). Time-approximation trade-offs for inapproximable problems. Journal of Computer and System Sciences. 92. 171–180. 6 indexed citations

17.

Bonnet, Édouard, et al.. (2016). On the complexity of connection games. Theoretical Computer Science. 644. 2–28. 5 indexed citations

18.

Bonnet, Édouard, Vangélis Th. Paschos, & Florian Sikora. (2016). Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems. RAIRO - Theoretical Informatics and Applications. 50(3). 227–240. 7 indexed citations

19.

Bonnet, Édouard, et al.. (2014). Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica. 71(3). 566–580. 7 indexed citations

20.

Bonnet, Édouard & Vangélis Th. Paschos. (2014). Parameterized (in)approximability of subset problems. Operations Research Letters. 42(3). 222–225. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact