Benjamin Lévêque

459 total citations
28 papers, 167 citations indexed

About

Benjamin Lévêque is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Benjamin Lévêque has authored 28 papers receiving a total of 167 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 15 papers in Discrete Mathematics and Combinatorics and 4 papers in Computer Networks and Communications. Recurrent topics in Benjamin Lévêque's work include Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (17 papers) and Limits and Structures in Graph Theory (14 papers). Benjamin Lévêque is often cited by papers focused on Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (17 papers) and Limits and Structures in Graph Theory (14 papers). Benjamin Lévêque collaborates with scholars based in France, Canada and United States. Benjamin Lévêque's co-authors include Alexandre Pinlou, Frédéric Maffray, Marthe Bonamy, Nicolas Trotignon, Pinar Heggernes, Pim van ’t Hof, Christophe Paul, Myriam Preissmann, Daniel Gonçalves and Chı́nh T. Hoàng and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Benjamin Lévêque

27 papers receiving 161 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Benjamin Lévêque France 8 156 68 34 25 24 28 167
Marthe Bonamy France 9 175 1.1× 86 1.3× 29 0.9× 14 0.6× 33 1.4× 34 188
Nicolas Trotignon France 10 202 1.3× 107 1.6× 32 0.9× 14 0.6× 23 1.0× 38 205
Martin Vatshelle Norway 10 232 1.5× 72 1.1× 81 2.4× 12 0.5× 26 1.1× 19 251
Hoàng-Oanh Le Germany 10 199 1.3× 57 0.8× 58 1.7× 12 0.5× 52 2.2× 17 204
Deepak Rajendraprasad India 6 166 1.1× 78 1.1× 39 1.1× 6 0.2× 34 1.4× 24 172
Luke Postle Canada 6 110 0.7× 80 1.2× 14 0.4× 10 0.4× 24 1.0× 35 116
Célia Picinin de Mello Brazil 10 231 1.5× 86 1.3× 35 1.0× 8 0.3× 51 2.1× 30 248
Edita Máčajová Slovakia 9 193 1.2× 113 1.7× 30 0.9× 13 0.5× 46 1.9× 46 207
Jérémie Chalopin France 8 92 0.6× 24 0.4× 30 0.9× 18 0.7× 41 1.7× 31 134
Luis Cereceda United Kingdom 5 201 1.3× 64 0.9× 79 2.3× 6 0.2× 17 0.7× 7 206

Countries citing papers authored by Benjamin Lévêque

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Benjamin Lévêque

This figure shows the co-authorship network connecting the top 25 collaborators of Benjamin Lévêque. A scholar is included among the top collaborators of Benjamin Lévêque based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Benjamin Lévêque. Benjamin Lévêque is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lévêque, Benjamin, et al.. (2025). Reconfiguration of Digraph Homomorphisms. SIAM Journal on Discrete Mathematics. 39(1). 327–360. 1 indexed citations
2.
Lévêque, Benjamin, et al.. (2023). Locating-dominating sets in local tournaments. Discrete Applied Mathematics. 337. 14–24. 1 indexed citations
3.
Bonichon, Nicolas & Benjamin Lévêque. (2019). A Bijection for Essentially 4-Connected Toroidal Triangulations. The Electronic Journal of Combinatorics. 26(1).
4.
Bonamy, Marthe, Benjamin Lévêque, & Alexandre Pinlou. (2014). 2‐Distance Coloring of Sparse Graphs. Journal of Graph Theory. 77(3). 190–218. 17 indexed citations
5.
Lévêque, Benjamin, et al.. (2014). COMMENT UTILISER LES FLUX, INDICATEURS ET METHODES ACV EXISTANTS POUR TRAITER L'IMPACT SUR LA BIODIVERSITE. HAL (Le Centre pour la Communication Scientifique Directe). 155. 1 indexed citations
6.
Bonamy, Marthe, Benjamin Lévêque, & Alexandre Pinlou. (2014). List coloring the square of sparse graphs with large degree. European Journal of Combinatorics. 41. 128–137. 7 indexed citations
7.
Heggernes, Pinar, Pim van ’t Hof, Benjamin Lévêque, & Christophe Paul. (2013). Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Applied Mathematics. 164. 444–449. 6 indexed citations
8.
Bonamy, Marthe, Benjamin Lévêque, & Alexandre Pinlou. (2013). Graphs with maximum degreeΔ17and maximum average degree less than3are list2-distance(Δ+2)-colorable. Discrete Mathematics. 317. 19–32. 18 indexed citations
9.
Gonçalves, Daniel & Benjamin Lévêque. (2013). Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Discrete & Computational Geometry. 51(1). 67–131. 3 indexed citations
10.
Lévêque, Benjamin, Frédéric Maffray, & Nicolas Trotignon. (2012). On graphs with no induced subdivision of K4. Journal of Combinatorial Theory Series B. 102(4). 924–947. 12 indexed citations
11.
Heggernes, Pinar, Pim van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, & Christophe Paul. (2012). Contracting Graphs to Paths and Trees. Algorithmica. 68(1). 109–132. 17 indexed citations
12.
Cameron, Kathie, Benjamin Lévêque, & Frédéric Maffray. (2011). Coloring vertices of a graph or finding a Meyniel obstruction. Theoretical Computer Science. 428. 10–17. 1 indexed citations
13.
Lévêque, Benjamin & D. de Werra. (2011). Graph transformations preserving the stability number. Discrete Applied Mathematics. 160(18). 2752–2759. 1 indexed citations
14.
Heggernes, Pinar, et al.. (2011). Contracting chordal graphs and bipartite graphs to paths and trees. Electronic Notes in Discrete Mathematics. 37. 87–92. 3 indexed citations
15.
Cameron, Kathie, Chı́nh T. Hoàng, & Benjamin Lévêque. (2010). Characterizing directed path graphs by forbidden asteroids. Journal of Graph Theory. 68(2). 103–112. 4 indexed citations
16.
Lévêque, Benjamin, et al.. (2009). Detecting induced subgraphs. Discrete Applied Mathematics. 157(17). 3540–3551. 21 indexed citations
17.
Lévêque, Benjamin & D. de Werra. (2009). Graph transformations preserving the stability number. Electronic Notes in Discrete Mathematics. 35. 3–8. 2 indexed citations
18.
Lévêque, Benjamin, Frédéric Maffray, Bruce Reed, & Nicolas Trotignon. (2009). Coloring Artemis graphs. Theoretical Computer Science. 410(21-23). 2234–2240. 2 indexed citations
19.
Lévêque, Benjamin & Myriam Preissmann. (2008). Characterizing path graphs by forbidden induced subgraphs. ArXiv.org. 10 indexed citations
20.
Frein, Yannick, et al.. (2008). Generating All Sets With Bounded Unions. Combinatorics Probability Computing. 17(5). 641–660. 4 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026