Frédéric Maffray
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
Papers in
-
- Advanced Graph Theory Research 133
- Complexity and Algorithms in Graphs 5
- Graph Labeling and Dimension Problems 2
-
- Limits and Structures in Graph Theory 5
- Co-authors
- Chı́nh T. Hoàng (14 shared papers)Myriam Preissmann (12 shared papers)Peter L. Hammer (5 shared papers)Nicolas Trotignon (14 shared papers)Sylvain Gravier (9 shared papers)Ryan Hayward (2 shared papers)T. Karthick (9 shared papers)Mustapha Chellali (7 shared papers)
- Journals
- Discrete Mathematics (23 papers)Discrete Applied Mathematics (23 papers)Journal of Graph Theory (18 papers)Graphs and Combinatorics (14 papers)Journal of Combinatorial Theory Series B (9 papers)
- Partner nations
- FranceUnited StatesCanada
In The Last Decade
Frédéric Maffray
132 papers receiving 1.5k citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 1.5k
- Discrete Mathematics and Combinatorics 58
- Algebra and Number Theory 17
- Geometry and Topology 24
- Computer Graphics and Computer-Aided Design 4
Countries citing papers authored by Frédéric Maffray
This map shows the geographic impact of Frédéric Maffray'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 Maffray 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 Maffray more than expected).
Fields of papers citing papers by Frédéric Maffray
This network shows the impact of papers produced by Frédéric Maffray. 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 Maffray. The network helps show where Frédéric Maffray may publish in the future.
Co-authors
The 25 scholars most cited alongside Frédéric Maffray, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 136 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1990 | 137 | |
| 2 | 1996 | 109 | |
| 3 | 1990 | 73 | |
| 4 | 1989 | 70 | |
| 5 | 2003 | 55 | |
| 6 | 1992 | 46 | |
| 7 | Locating-domination and identifying codes in trees | 2007 | 43 |
| 8 | 2011 | 43 | |
| 9 | 2009 | 42 | |
| 10 | 2009 | 39 | |
| 11 | 2005 | 36 | |
| 12 | 2012 | 34 | |
| 13 | 1994 | 30 | |
| 14 | 2012 | 29 | |
| 15 | 1998 | 28 | |
| 16 | 1999 | 28 | |
| 17 | 2009 | 26 | |
| 18 | 2013 | 23 | |
| 19 | 1997 | 21 | |
| 20 | 2016 | 20 |
About Frédéric Maffray
Frédéric Maffray is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Industrial and Manufacturing Engineering, Nuclear Energy and Engineering and Waste Management and Disposal, having authored 136 papers that have together received 1.6k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (133 papers), Limits and Structures in Graph Theory (5 papers), Complexity and Algorithms in Graphs (5 papers), Graph Labeling and Dimension Problems (2 papers) and Scheduling and Optimization Algorithms (1 paper). The work is most often cited by research in Computational Theory and Mathematics (1.5k citations), Discrete Mathematics and Combinatorics (58 citations), Algebra and Number Theory (17 citations), Geometry and Topology (24 citations) and Computer Graphics and Computer-Aided Design (4 citations). Frédéric Maffray has collaborated with scholars based in France, United States and Canada. Frequent co-authors include Chı́nh T. Hoàng, Myriam Preissmann, Peter L. Hammer, Nicolas Trotignon, Sylvain Gravier, Ryan Hayward, T. Karthick, Mustapha Chellali, Mostafa Blidia and Benjamin Lévêque. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Graphs and Combinatorics and Journal of Combinatorial Theory Series B.
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.