Benjamin Lévêque
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
-
- Advanced Combinatorial Mathematics
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 29
- Graph Labeling and Dimension Problems 4
- Complexity and Algorithms in Graphs 2
-
- Advanced Combinatorial Mathematics 7
- Co-authors
- Alexandre Pinlou (7 shared papers)Frédéric Maffray (8 shared papers)Nicolas Trotignon (4 shared papers)Marthe Bonamy (4 shared papers)Daniel Gonçalves (6 shared papers)Christophe Paul (4 shared papers)Pinar Heggernes (4 shared papers)Pim van ’t Hof (4 shared papers)
In The Last Decade
Benjamin Lévêque
35 papers receiving 269 citations
Peers
Comparison fields: 5 of 11
- Computational Theory and Mathematics 264
- Discrete Mathematics and Combinatorics 26
- Computer Graphics and Computer-Aided Design 24
- Algebra and Number Theory 2
- Numerical Analysis 1
Countries citing papers authored by Benjamin Lévêque
This map shows the geographic impact of Benjamin Lévêque'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 Benjamin Lévêque with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Benjamin Lévêque more than expected).
Fields of papers citing papers by Benjamin Lévêque
This network shows the impact of papers produced by Benjamin Lévêque. 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 Benjamin Lévêque. The network helps show where Benjamin Lévêque may publish in the future.
Co-authors
The 22 scholars most cited alongside Benjamin Lévêque, 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 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 39 | |
| 2 | 2012 | 34 | |
| 3 | 2012 | 28 | |
| 4 | 2014 | 22 | |
| 5 | 2013 | 20 | |
| 6 | 2012 | 17 | |
| 7 | 2013 | 12 | |
| 8 | 2011 | 11 | |
| 9 | 2022 | 10 | |
| 10 | 2013 | 9 | |
| 11 | 2012 | 8 | |
| 12 | 2009 | 7 | |
| 13 | 2011 | 7 | |
| 14 | 2014 | 7 | |
| 15 | 2016 | 6 | |
| 16 | 2010 | 5 | |
| 17 | 2008 | 4 | |
| 18 | 2008 | 4 | |
| 19 | 2009 | 4 | |
| 20 | 2010 | 4 |
About Benjamin Lévêque
Benjamin Lévêque is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Nuclear Energy and Engineering and Waste Management and Disposal, having authored 35 papers that have together received 285 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (29 papers), Advanced Combinatorial Mathematics (7 papers), Graph Labeling and Dimension Problems (4 papers), Computational Geometry and Mesh Generation (3 papers) and Complexity and Algorithms in Graphs (2 papers). The work is most often cited by research in Computational Theory and Mathematics (264 citations), Discrete Mathematics and Combinatorics (26 citations), Computer Graphics and Computer-Aided Design (24 citations), Algebra and Number Theory (2 citations) and Numerical Analysis (1 citation). Benjamin Lévêque has collaborated with scholars based in France, Canada and Norway. Frequent co-authors include Alexandre Pinlou, Frédéric Maffray, Nicolas Trotignon, Marthe Bonamy, Daniel Gonçalves, Christophe Paul, Pinar Heggernes, Pim van ’t Hof, Daniel Lokshtanov and Louis Esperet. Their work appears in journals such as Discrete Applied Mathematics, Theoretical Computer Science, Discrete & Computational Geometry, European Journal of Combinatorics and Journal of Graph Theory.
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.