default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Pellegrini
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Julien Rodriguez
, François Galea, François Pellegrini, Lilia Zaourar:
Hypergraph Clustering with Path-Length Awareness. ICCS (5) 2024: 90-104- 2023
- [c10]Julien Rodriguez, François Galea, François Pellegrini, Lilia Zaourar:
Path Length-Driven Hypergraph Partitioning: An Integer Programming Approach. FedCSIS 2023: 1119-1123 - [c9]Julien Rodriguez, François Galea, François Pellegrini, Lilia Zaourar:
A Hypergraph Model and Associated Optimization Strategies for Path Length-Driven Netlist Partitioning. ICCS (3) 2023: 652-660 - [i5]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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i4]George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023)
2010 – 2019
- 2018
- [c8]Rémi Barat, Cédric Chevalier, François Pellegrini:
Multi-criteria Graph Partitioning with Scotch. CSC 2018: 66-75 - 2012
- [i3]François Pellegrini, Sébastien Canevet:
Le droit du numérique : une histoire à préserver. CoRR abs/1210.3597 (2012)
2000 – 2009
- 2009
- [b1]François Pellegrini:
Contributions au partitionnement de graphes parallèle multi-niveaux (Contributions to parallel multilevel graph partitioning). University of Bordeaux, France, 2009 - [i2]François Pellegrini:
Distillating knowledge about SCOTCH. Combinatorial Scientific Computing 2009 - [i1]Cédric Chevalier, François Pellegrini:
PT-Scotch: A tool for efficient parallel graph ordering. CoRR abs/0907.1375 (2009) - 2008
- [j6]Cédric Chevalier, François Pellegrini:
PT-Scotch: A tool for efficient parallel graph ordering. Parallel Comput. 34(6-8): 318-331 (2008) - 2007
- [c7]François Pellegrini:
A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth Boundaries. Euro-Par 2007: 195-204 - 2006
- [c6]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
- [c5]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
- [j5]François Pellegrini, Jean Roman, Patrick Amestoy:
Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering. Concurr. Pract. Exp. 12(2-3): 69-84 (2000) - [j4]David Goudin, Pascal Hénon, François Pellegrini, Pierre Ramet, Jean Roman, Jean-Jacques Pesqué:
Parallel sparse linear algebra and application to structural mechanics. Numer. Algorithms 24(4): 371-391 (2000)
1990 – 1999
- 1999
- [c4]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
- [j3]François Pellegrini:
Graph Partitioning Based Methods and Tools for Scientific Computing. Parallel Comput. 23(1-2): 153-164 (1997) - [c3]François Pellegrini, Jean Roman:
Sparse Matrix Ordering with SCOTCH. HPCN Europe 1997: 370-378 - [c2]Jean Michel, François Pellegrini, Jean Roman:
Unstructured Grapg Partitioning for Sparse Linear System Solving. IRREGULAR 1997: 273-286 - 1996
- [c1]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
- [j2]Dominique Barth, François Pellegrini, André Raspaud, Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs. RAIRO Theor. Informatics Appl. 29(6): 487-508 (1995) - 1993
- [j1]François Pellegrini:
Bounds for the Bandwidth of the d-Ary de Bruijn Graph. Parallel Process. Lett. 3: 431-443 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
