Hervé Fournier
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Discrete Mathematics and Combinatorics top 10%
- Geometry and Topology top 10%
- Computer Networks and Communications
- Co-authors
- Dominique BarthAntoine VigneronNutan LimayeSrikanth SrinivasanOlivier TeytaudPascal KoiranA. L. ChistovLeonid Gurvits
- Topics
- Complexity and Algorithms in Graphs (8 papers)Advanced Graph Theory Research (6 papers)Limits and Structures in Graph Theory (4 papers)
In The Last Decade
Hervé Fournier
18 papers receiving 140 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 107
- Artificial Intelligence 48
- Discrete Mathematics and Combinatorics 39
- Geometry and Topology 30
- Computer Networks and Communications 19
Countries citing papers authored by Hervé Fournier
This map shows the geographic impact of Hervé Fournier'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 Hervé Fournier with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hervé Fournier more than expected).
Fields of papers citing papers by Hervé Fournier
This network shows the impact of papers produced by Hervé Fournier. 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 Hervé Fournier. The network helps show where Hervé Fournier may publish in the future.
Co-authorship network of co-authors of Hervé Fournier
This figure shows the co-authorship network connecting the top 25 collaborators of Hervé Fournier. A scholar is included among the top collaborators of Hervé Fournier 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 Hervé Fournier. Hervé Fournier is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 2 | |
| 4 | 7 | |
| 5 | 23 | |
| 6 | 21 | |
| 7 | 3 | |
| 8 | Lower bounds for depth 4 formulas computing iterated matrix multiplication. | 2 |
| 9 | 4 | |
| 10 | 5 | |
| 11 | 3 | |
| 12 | 11 | |
| 13 | 10 | |
| 14 | 2 | |
| 15 | 7 | |
| 16 | 2 | |
| 17 | 31 | |
| 18 | 18 | |
| 19 | 1 |
About Hervé Fournier
Hervé Fournier is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 19 papers that have together received 153 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (8 papers), Advanced Graph Theory Research (6 papers) and Limits and Structures in Graph Theory (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (39 citations), Computational Theory and Mathematics (107 citations) and Computer Graphics and Computer-Aided Design (13 citations). Hervé Fournier has collaborated with scholars based in France, Denmark and Russia. Frequent co-authors include Dominique Barth, Antoine Vigneron, Nutan Limaye, Srikanth Srinivasan, Olivier Teytaud, Pascal Koiran, A. L. Chistov, Leonid Gurvits, Danièle Gardy and Meena Mahajan. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Linear Algebra and its Applications.
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.