Frédéric Gardi
Impact in
-
- Scheduling and Optimization Algorithms
- Vehicle Routing Optimization Methods
- Assembly Line Balancing Optimization
- Advanced Manufacturing and Logistics Optimization
- Optimization and Packing Problems
Papers in
-
- Scheduling and Optimization Algorithms 6
- Vehicle Routing Optimization Methods 4
- Assembly Line Balancing Optimization 3
-
- Advanced Graph Theory Research 4
- Complexity and Algorithms in Graphs 3
- Formal Methods in Verification 2
Frédéric Gardi
12 papers receiving 189 citations
Peers
Comparison fields: 5 of 40
- Industrial and Manufacturing Engineering 124
- Discrete Mathematics and Combinatorics 13
- Computational Theory and Mathematics 49
- Computer Networks and Communications 43
- Software 5
Countries citing papers authored by Frédéric Gardi
This map shows the geographic impact of Frédéric Gardi'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 Frédéric Gardi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frédéric Gardi more than expected).
Fields of papers citing papers by Frédéric Gardi
This network shows the impact of papers produced by Frédéric Gardi. 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 Frédéric Gardi. The network helps show where Frédéric Gardi may publish in the future.
Co-authors
The 2 scholars most cited alongside Frédéric Gardi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 46 | |
| 2 | 2007 | 36 | |
| 3 | 2007 | 29 | |
| 4 | 2011 | 23 | |
| 5 | 2008 | 20 | |
| 6 | 2006 | 17 | |
| 7 | 2012 | 10 | |
| 8 | 2006 | 6 | |
| 9 | Ordonnancement de véhicules: une approche par recherche locale à grand voisinage | 2005 | 5 |
| 10 | 2007 | 4 | |
| 11 | 2012 | 3 | |
| 12 | Recherche locale haute performance pour la planification des interventions à France Télécom | 2008 | 1 |
| 13 | 2006 | 0 | |
| 14 | 2010 | 0 |
About Frédéric Gardi
Frédéric Gardi is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics, Computer Networks and Communications, Biomedical Engineering and Discrete Mathematics and Combinatorics, having authored 14 papers that have together received 200 indexed citations. Recurring topics across this work include Scheduling and Optimization Algorithms (6 papers), Vehicle Routing Optimization Methods (4 papers), Advanced Graph Theory Research (4 papers), Optimization and Search Problems (3 papers), Complexity and Algorithms in Graphs (3 papers), Assembly Line Balancing Optimization (3 papers), Biofuel production and bioconversion (2 papers) and Formal Methods in Verification (2 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (124 citations), Discrete Mathematics and Combinatorics (13 citations), Computational Theory and Mathematics (49 citations), Computer Networks and Communications (43 citations) and Software (5 citations). Frédéric Gardi has collaborated with scholars based in France and United Kingdom. Frequent co-authors include Bertrand Estellon and Alain David. Their work appears in journals such as 4OR, Discrete Applied Mathematics, Journal of Graph Theory, European Journal of Operational Research and Discrete Mathematics.
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.