Hadrien Mélot
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- Graph theory and applications 14
-
- Limits and Structures in Graph Theory 4
- Co-authors
- Pierre Hansenİvan GutmanKris CoolsaetGunnar BrinkmannJan GoedgebeurDragan StevanovićVéronique BruyèreAlain Hertz
In The Last Decade
Hadrien Mélot
15 papers receiving 240 citations
Peers
Comparison fields: 5 of 39
- Discrete Mathematics and Combinatorics 66
- Geometry and Topology 153
- Computational Theory and Mathematics 192
- Organic Chemistry 62
- Algebra and Number Theory 6
Countries citing papers authored by Hadrien Mélot
This map shows the geographic impact of Hadrien Mélot'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 Hadrien Mélot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hadrien Mélot more than expected).
Fields of papers citing papers by Hadrien Mélot
This network shows the impact of papers produced by Hadrien Mélot. 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 Hadrien Mélot. The network helps show where Hadrien Mélot may publish in the future.
Co-authorship network
The 14 scholars most cited alongside Hadrien Mélot, 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 | 2024 | 1 | |
| 2 | 2024 | 0 | |
| 3 | 2022 | 0 | |
| 4 | 2019 | 1 | |
| 5 | 2019 | 1 | |
| 6 | 2016 | 2 | |
| 7 | 2015 | 5 | |
| 8 | 2012 | 81 | |
| 9 | 2011 | 2 | |
| 10 | Prix de la connexité pour le problème de l'ensemble dominant, Mathématiques | 2010 | 1 |
| 11 | 2009 | 7 | |
| 12 | 2008 | 7 | |
| 13 | 2007 | 24 | |
| 14 | 2005 | 55 | |
| 15 | Variable Neighborhood Search for Extremal Graphs. 12. A Note on the Variance of Bounded Degrees in Graphs | 2004 | 14 |
| 16 | 2002 | 9 | |
| 17 | 2002 | 42 | |
| 18 | 2002 | 14 |
About Hadrien Mélot
Hadrien Mélot is a scholar working on Geometry and Topology, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Statistics and Probability and Mathematical Physics, having authored 18 papers that have together received 266 indexed citations. Recurring topics across this work include Graph theory and applications (14 papers), Advanced Graph Theory Research (10 papers), Graph Labeling and Dimension Problems (6 papers), Computational Drug Discovery Methods (5 papers), Limits and Structures in Graph Theory (4 papers), Graphene research and applications (2 papers), Interconnection Networks and Systems (2 papers) and Point processes and geometric inequalities (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (66 citations), Geometry and Topology (153 citations), Computational Theory and Mathematics (192 citations), Organic Chemistry (62 citations) and Algebra and Number Theory (6 citations). Hadrien Mélot has collaborated with scholars based in Belgium, Canada and Serbia. Frequent co-authors include Pierre Hansen, İvan Gutman, Kris Coolsaet, Gunnar Brinkmann, Jan Goedgebeur, Dragan Stevanović, Véronique Bruyère, Alain Hertz, Jean‐Paul Doignon and Martine Labbé. Their work appears in journals such as Discrete Applied Mathematics, Journal of Combinatorial Optimization, Networks, Graphs and Combinatorics and Linear Algebra and its Applications.
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.