Hervé Fournier

450 total citations
19 papers, 153 citations indexed

About

Hervé Fournier is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Hervé Fournier has authored 19 papers receiving a total of 153 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Hervé Fournier's work include Complexity and Algorithms in Graphs (8 papers), Advanced Graph Theory Research (6 papers) and Limits and Structures in Graph Theory (4 papers). Hervé Fournier is often cited by papers focused on Complexity and Algorithms in Graphs (8 papers), Advanced Graph Theory Research (6 papers) and Limits and Structures in Graph Theory (4 papers). Hervé Fournier collaborates with scholars based in France, Russia and Saudi Arabia. Hervé Fournier's co-authors include Dominique Barth, Antoine Vigneron, Nutan Limaye, Srikanth Srinivasan, Olivier Teytaud, A. L. Chistov, Leonid Gurvits, Pascal Koiran, Danièle Gardy and Bernhard Gittenberger and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Linear Algebra and its Applications.

In The Last Decade

Hervé Fournier

18 papers receiving 140 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Hervé Fournier France	8	107	48	39	30	19	19	153
Omid Amini France	9	142 1.3×	14 0.3×	35 0.9×	75 2.5×	39 2.1×	28	207
Gábor Kun Hungary	9	124 1.2×	21 0.4×	33 0.8×	32 1.1×	52 2.7×	23	181
Youming Qiao Australia	8	97 0.9×	76 1.6×	32 0.8×	39 1.3×	8 0.4×	32	177
Vít Jelínek Czechia	9	104 1.0×	47 1.0×	120 3.1×	25 0.8×	10 0.5×	30	187
Jean-Luc Rémy France	6	48 0.4×	54 1.1×	24 0.6×	10 0.3×	4 0.2×	23	120
Nora Hartsfield United States	7	199 1.9×	15 0.3×	33 0.8×	41 1.4×	19 1.0×	19	255
John Abbott Italy	7	107 1.0×	47 1.0×	12 0.3×	15 0.5×	8 0.4×	23	152
János Barát Hungary	9	215 2.0×	35 0.7×	127 3.3×	47 1.6×	36 1.9×	42	270
Xiumin Du United States	6	35 0.3×	37 0.8×	30 0.8×	25 0.8×	33 1.7×	9	212
Ishay Haviv Israel	7	99 0.9×	76 1.6×	17 0.4×	9 0.3×	60 3.2×	33	167

Countries citing papers authored by Hervé Fournier

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

19 of 19 papers shown

Fournier, Hervé, et al.. (2024). On the Power of Homogeneous Algebraic Formulas. IT University Of Copenhagen (IT University of Copenhagen). 141–151.

Fournier, Hervé, et al.. (2023). Towards Optimal Depth-Reductions for Algebraic Formulas. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

Fournier, Hervé, Nutan Limaye, Meena Mahajan, & Srikanth Srinivasan. (2017). . Theory of Computing. 13(1). 1–34. 2 indexed citations

Fournier, Hervé, et al.. (2015). Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM Journal on Computing. 44(5). 1173–1201. 7 indexed citations

Fournier, Hervé, et al.. (2015). Computing the Gromov hyperbolicity of a discrete metric space. Information Processing Letters. 115(6-8). 576–579. 23 indexed citations

Fournier, Hervé, et al.. (2014). Lower bounds for depth 4 formulas computing iterated matrix multiplication. 128–135. 21 indexed citations

Fournier, Hervé, et al.. (2014). Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Computational Complexity. 24(1). 1–30. 3 indexed citations

Fournier, Hervé, et al.. (2013). Lower bounds for depth 4 formulas computing iterated matrix multiplication.. Electronic colloquium on computational complexity. 20. 100. 2 indexed citations

Fournier, Hervé & Antoine Vigneron. (2012). A deterministic algorithm for fitting a step function to a weighted point-set. Information Processing Letters. 113(3). 51–54. 4 indexed citations

10.

Fournier, Hervé, et al.. (2011). The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms. 40(3). 317–349. 5 indexed citations

11.

Fournier, Hervé, et al.. (2010). Tautologies over implication with negative literals. Mathematical logic quarterly. 56(4). 388–396. 3 indexed citations

12.

Fournier, Hervé & Olivier Teytaud. (2010). Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica. 59(3). 387–408. 11 indexed citations

13.

Fournier, Hervé & Antoine Vigneron. (2009). Fitting a Step Function to a Point Set. Algorithmica. 60(1). 95–109. 10 indexed citations

14.

Chistov, A. L., et al.. (2008). On the construction of a family of transversal subspaces over finite fields. Linear Algebra and its Applications. 429(2-3). 589–600. 2 indexed citations

15.

Barth, Dominique, et al.. (2008). On the shape of decomposable trees. Discrete Mathematics. 309(12). 3882–3887. 7 indexed citations

16.

Fournier, Hervé & Antoine Vigneron. (2007). A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. Algorithmica. 49(3). 245–257. 2 indexed citations

17.

Barth, Dominique & Hervé Fournier. (2006). A degree bound on decomposable trees. Discrete Mathematics. 306(5). 469–477. 31 indexed citations

18.

Chistov, A. L., Hervé Fournier, Leonid Gurvits, & Pascal Koiran. (2003). Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. Foundations of Computational Mathematics. 3(4). 421–427. 18 indexed citations

19.

Fournier, Hervé. (2001). Sparse NP-complete problems over the reals with addition. Theoretical Computer Science. 255(1-2). 607–610. 1 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