Bounds for the Bandwidth of the d-Ary de Bruijn Graph. - François Pellegrini (Parallel Process. Lett., 1993)

On Bandwidth, Cutwidth, and Quotient Graphs. - Dominique Barth; François Pellegrini; André Raspaud; Jean Roman (RAIRO Theor. Informatics Appl., 1995)

SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs. - François Pellegrini; Jean Roman (HPCN Europe, 1996)

Sparse Matrix Ordering with SCOTCH. - François Pellegrini; Jean Roman (HPCN Europe, 1997)

Unstructured Grapg Partitioning for Sparse Linear System Solving. - Jean Michel; François Pellegrini; Jean Roman (IRREGULAR, 1997)

Graph Partitioning Based Methods and Tools for Scientific Computing. - François Pellegrini (Parallel Comput., 1997)

Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering. - François Pellegrini; Jean Roman; Patrick Amestoy (Concurr. Pract. Exp., 2000)

Parallel sparse linear algebra and application to structural mechanics. - David Goudin; Pascal Hénon; François Pellegrini; Pierre Ramet; Jean Roman; Jean-Jacques Pesqué (Numer. Algorithms, 2000)

Applying Parallel Direct Solver Techniques to Build Robust High Performance Preconditioners. - Pascal Hénon; François Pellegrini; Pierre Ramet; Jean Roman; Yousef Saad (PARA, 2004)

Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework. - Cédric Chevalier; François Pellegrini (Euro-Par, 2006)

A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth Boundaries. - François Pellegrini (Euro-Par, 2007)

PT-Scotch: A tool for efficient parallel graph ordering. - Cédric Chevalier; François Pellegrini (Parallel Comput., 2008)

Contributions au partitionnement de graphes parallèle multi-niveaux (Contributions to parallel multilevel graph partitioning). - François Pellegrini (2009)

Distillating knowledge about SCOTCH. - François Pellegrini (Combinatorial Scientific Computing, 2009)

Le droit du numérique : une histoire à préserver - François Pellegrini; Sébastien Canevet (CoRR, 2012)

Multi-criteria Graph Partitioning with Scotch. - Rémi Barat; Cédric Chevalier; François Pellegrini (CSC, 2018)

Path Length-Driven Hypergraph Partitioning: An Integer Programming Approach. - Julien Rodriguez; François Galea; François Pellegrini; Lilia Zaourar (FedCSIS, 2023)

A Hypergraph Model and Associated Optimization Strategies for Path Length-Driven Netlist Partitioning. - Julien Rodriguez; François Galea; François Pellegrini; Lilia Zaourar (ICCS (3), 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Hypergraph Clustering with Path-Length Awareness. - Julien Rodriguez; François Galea; François Pellegrini; Lilia Zaourar (ICCS (5), 2024)