| 2008 |
|---|
| 12 | EE | Cédric Chevalier,
François Pellegrini:
PT-Scotch.
Parallel Computing 34(6-8): 318-331 (2008) |
| 2007 |
|---|
| 11 | EE | François Pellegrini:
A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth Boundaries.
Euro-Par 2007: 195-204 |
| 2006 |
|---|
| 10 | EE | Cédric Chevalier,
François Pellegrini:
Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework.
Euro-Par 2006: 243-252 |
| 2004 |
|---|
| 9 | EE | Pascal Hénon,
François Pellegrini,
Pierre Ramet,
Jean Roman,
Yousef Saad:
Applying Parallel Direct Solver Techniques to Build Robust High Performance Preconditioners.
PARA 2004: 611-619 |
| 2000 |
|---|
| 8 | | François Pellegrini,
Jean Roman,
Patrick Amestoy:
Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering.
Concurrency - Practice and Experience 12(2-3): 69-84 (2000) |
| 1999 |
|---|
| 7 | | François Pellegrini,
Jean Roman,
Patrick Amestoy:
Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering.
IPPS/SPDP Workshops 1999: 986-995 |
| 1997 |
|---|
| 6 | | François Pellegrini,
Jean Roman:
Sparse Matrix Ordering with SCOTCH.
HPCN Europe 1997: 370-378 |
| 5 | | Jean Michel,
François Pellegrini,
Jean Roman:
Unstructured Grapg Partitioning for Sparse Linear System Solving.
IRREGULAR 1997: 273-286 |
| 4 | | François Pellegrini:
Graph Partitioning Based Methods and Tools for Scientific Computing.
Parallel Computing 23(1-2): 153-164 (1997) |
| 1996 |
|---|
| 3 | | François Pellegrini,
Jean Roman:
SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs.
HPCN Europe 1996: 493-498 |
| 1995 |
|---|
| 2 | | Dominique Barth,
François Pellegrini,
André Raspaud,
Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs.
ITA 29(6): 487-508 (1995) |
| 1993 |
|---|
| 1 | | François Pellegrini:
Bounds for the Bandwidth of the d-Ary de Bruijn Graph.
Parallel Processing Letters 3: 431-443 (1993) |
