Frédéric Havet
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 83
- Graph Labeling and Dimension Problems 51
- Complexity and Algorithms in Graphs 7
-
- Limits and Structures in Graph Theory 37
- Co-authors
- Jean‐Sébastien Sereni (8 shared papers)Stéphan Thomassé (10 shared papers)Bruce Reed (6 shared papers)Nathann Cohen (14 shared papers)Cláudia Linhares Sales (7 shared papers)Min‐Li Yu (2 shared papers)Louigi Addario‐Berry (3 shared papers)Jørgen Bang‐Jensen (11 shared papers)
In The Last Decade
Frédéric Havet
88 papers receiving 732 citations
Peers
Comparison fields: 5 of 36
- Discrete Mathematics and Combinatorics 287
- Computational Theory and Mathematics 684
- Computer Graphics and Computer-Aided Design 63
- Geometry and Topology 66
- Computer Networks and Communications 100
Countries citing papers authored by Frédéric Havet
This map shows the geographic impact of Frédéric Havet'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 Havet 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 Havet more than expected).
Fields of papers citing papers by Frédéric Havet
This network shows the impact of papers produced by Frédéric Havet. 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 Havet. The network helps show where Frédéric Havet may publish in the future.
Co-authors
The 25 scholars most cited alongside Frédéric Havet, 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 96 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2006 | 42 | |
| 2 | 2007 | 34 | |
| 3 | 2007 | 33 | |
| 4 | 2011 | 31 | |
| 5 | 2008 | 30 | |
| 6 | 2000 | 26 | |
| 7 | 2011 | 24 | |
| 8 | 2000 | 24 | |
| 9 | 2012 | 23 | |
| 10 | 2008 | 22 | |
| 11 | 2012 | 21 | |
| 12 | L(2,1)-labelling of graphs | 2008 | 16 |
| 13 | 2013 | 16 | |
| 14 | 2001 | 16 | |
| 15 | 2011 | 16 | |
| 16 | 2009 | 15 | |
| 17 | 2009 | 14 | |
| 18 | 2004 | 14 | |
| 19 | 2010 | 14 | |
| 20 | 2008 | 13 |
About Frédéric Havet
Frédéric Havet is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Computer Networks and Communications and Geometry and Topology, having authored 96 papers that have together received 755 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (83 papers), Graph Labeling and Dimension Problems (51 papers), Limits and Structures in Graph Theory (37 papers), graph theory and CDMA systems (28 papers), Interconnection Networks and Systems (12 papers), Graph theory and applications (8 papers), Complexity and Algorithms in Graphs (7 papers) and Computational Geometry and Mesh Generation (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (287 citations), Computational Theory and Mathematics (684 citations), Computer Graphics and Computer-Aided Design (63 citations), Geometry and Topology (66 citations) and Computer Networks and Communications (100 citations). Frédéric Havet has collaborated with scholars based in France, Brazil and Austria. Frequent co-authors include Jean‐Sébastien Sereni, Stéphan Thomassé, Bruce Reed, Nathann Cohen, Cláudia Linhares Sales, Min‐Li Yu, Louigi Addario‐Berry, Jørgen Bang‐Jensen, Colin McDiarmid and Jan van den Heuvel. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, Discrete Applied Mathematics, Theoretical Computer Science and Algorithmica.
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.