This map shows the geographic impact of Pierre Ramet'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 Pierre Ramet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Ramet more than expected).
This network shows the impact of papers produced by Pierre Ramet. 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 Pierre Ramet. The network helps show where Pierre Ramet may publish in the future.
Co-authorship network of co-authors of Pierre Ramet
This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Ramet.
A scholar is included among the top collaborators of Pierre Ramet 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 Pierre Ramet. Pierre Ramet is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Faverge, Mathieu, et al.. (2016). Stratégie de renumérotation pour optimiser la granularité des calculs dans la résolution des systèmes linéaires creux. HAL (Le Centre pour la Communication Scientifique Directe).4 indexed citations
Barrault, Maxime, et al.. (2009). A Non Overlapping Parallel Domain Decomposition Method Applied to The Simplified Transport Equations. HAL (Le Centre pour la Communication Scientifique Directe).3 indexed citations
Faverge, Mathieu, et al.. (2008). Dynamic scheduling for sparse direct solver on NUMA architectures. HAL (Le Centre pour la Communication Scientifique Directe).2 indexed citations
13.
Faverge, Mathieu, et al.. (2008). A NUMA Aware Scheduler for a Parallel Sparse Direct Solver. HAL (Le Centre pour la Communication Scientifique Directe).1 indexed citations
14.
Hénon, Pascal, Pierre Ramet, & Jean Roman. (2006). On finding approximate supernodes for an efficient ILU(k) factorization. HAL (Le Centre pour la Communication Scientifique Directe).
15.
Nkonga, Boniface, et al.. (2006). Efficient solution technique for low Mach number compressible multiphase problems. HAL (Le Centre pour la Communication Scientifique Directe).2 indexed citations
16.
Hénon, Pascal, François Pellegrini, Pierre Ramet, Jean Roman, & Yousef Saad. (2004). High Performance Complete and Incomplete Factorizations for Very Large Sparse Systems by using Scotch and PaStiX softwares. HAL (Le Centre pour la Communication Scientifique Directe).
17.
Hénon, Pascal, Pierre Ramet, & Jean Roman. (2003). Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes. HAL (Le Centre pour la Communication Scientifique Directe).1 indexed citations
Hénon, Pascal, Pierre Ramet, & Jean Roman. (2001). PaStiX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment. HAL (Le Centre pour la Communication Scientifique Directe).4 indexed citations
20.
Hénon, Pascal, Pierre Ramet, & Jean Roman. (2000). PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems. HAL (Le Centre pour la Communication Scientifique Directe).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.