Jérôme Monnot

2.4k total citations
70 papers, 608 citations indexed

About

Jérôme Monnot is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Jérôme Monnot has authored 70 papers receiving a total of 608 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 20 papers in Computer Networks and Communications and 20 papers in Industrial and Manufacturing Engineering. Recurrent topics in Jérôme Monnot's work include Advanced Graph Theory Research (42 papers), Complexity and Algorithms in Graphs (35 papers) and Vehicle Routing Optimization Methods (17 papers). Jérôme Monnot is often cited by papers focused on Advanced Graph Theory Research (42 papers), Complexity and Algorithms in Graphs (35 papers) and Vehicle Routing Optimization Methods (17 papers). Jérôme Monnot collaborates with scholars based in France, Brazil and Germany. Jérôme Monnot's co-authors include Laurent Gourvès, Vangélis Th. Paschos, Sophie Toulouse, Bruno Escoffier, Refael Hassin, Marc Demange, Jérôme Lang, Cristina Bazgan, Danny Segev and Gerhard J. Woeginger and has published in prestigious journals such as European Journal of Operational Research, Theoretical Computer Science and Applied Mathematics Letters.

In The Last Decade

Jérôme Monnot

63 papers receiving 590 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jérôme Monnot France 15 353 195 177 103 85 70 608
Alexander Ageev Russia 10 209 0.6× 128 0.7× 225 1.3× 43 0.4× 88 1.0× 24 464
Bettina Klinz Austria 11 177 0.5× 146 0.7× 130 0.7× 36 0.3× 42 0.5× 33 516
Vladimir G. Deı̌neko United Kingdom 11 104 0.3× 256 1.3× 103 0.6× 92 0.9× 55 0.6× 45 463
Giulia Galbiati Italy 12 269 0.8× 171 0.9× 168 0.9× 30 0.3× 82 1.0× 32 469
Eranda Çela Austria 11 121 0.3× 252 1.3× 109 0.6× 26 0.3× 79 0.9× 29 455
Wolfgang Bein United States 10 80 0.2× 85 0.4× 134 0.8× 102 1.0× 37 0.4× 49 371
Dror Rawitz Israel 12 233 0.7× 118 0.6× 347 2.0× 56 0.5× 56 0.7× 71 541
Olivier Goldschmidt United States 12 252 0.7× 112 0.6× 204 1.2× 19 0.2× 58 0.7× 24 535
Kenji Onaga Japan 11 199 0.6× 107 0.5× 121 0.7× 29 0.3× 62 0.7× 67 395
Donald K. Wagner United States 9 170 0.5× 64 0.3× 140 0.8× 23 0.2× 69 0.8× 32 403

Countries citing papers authored by Jérôme Monnot

Since Specialization
Citations

This map shows the geographic impact of Jérôme Monnot'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 Jérôme Monnot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jérôme Monnot more than expected).

Fields of papers citing papers by Jérôme Monnot

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jérôme Monnot. 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 Jérôme Monnot. The network helps show where Jérôme Monnot may publish in the future.

Co-authorship network of co-authors of Jérôme Monnot

This figure shows the co-authorship network connecting the top 25 collaborators of Jérôme Monnot. A scholar is included among the top collaborators of Jérôme Monnot 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 Jérôme Monnot. Jérôme Monnot 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.
Sikora, Florian, et al.. (2022). On the complexity of solution extension of optimization problems. HAL (Le Centre pour la Communication Scientifique Directe). 4 indexed citations
2.
Monnot, Jérôme, et al.. (2018). Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theoretical Computer Science. 775. 1–15.
3.
Gourvès, Laurent, et al.. (2017). Bi-objective matchings with the triangle inequality. Theoretical Computer Science. 670. 1–10. 1 indexed citations
4.
Escoffier, Bruno, Laurent Gourvès, & Jérôme Monnot. (2016). The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica. 77(3). 836–866. 1 indexed citations
5.
Gourvès, Laurent, et al.. (2015). Worst case compromises in matroids with applications to the allocation of indivisible goods. Theoretical Computer Science. 589. 121–140. 6 indexed citations
6.
Bazgan, Cristina, et al.. (2013). Single approximation for the biobjective Max TSP. Theoretical Computer Science. 478. 41–50. 3 indexed citations
7.
Monnot, Jérôme, et al.. (2012). Reoptimization of maximum weight induced hereditary subgraph problems. Theoretical Computer Science. 514. 61–74. 3 indexed citations
8.
Alfandari, Laurent & Jérôme Monnot. (2012). A note on the Clustered Set Covering Problem. Discrete Applied Mathematics. 164. 13–19. 2 indexed citations
9.
Fritzilas, Epameinondas, Martin Milanič, Jérôme Monnot, & Yasmin Rios Solis. (2012). Resilience and optimization of identifiable bipartite graphs. Discrete Applied Mathematics. 161(4-5). 593–603.
10.
Gourvès, Laurent, et al.. (2012). Complexity of trails, paths and circuits in arc-colored digraphs. Discrete Applied Mathematics. 161(6). 819–828. 7 indexed citations
11.
Xia, Lirong, Jérôme Lang, & Jérôme Monnot. (2011). Possible winners when new alternatives join: new results coming up!. Adaptive Agents and Multi-Agents Systems. 829–836. 11 indexed citations
12.
Gourvès, Laurent, et al.. (2010). The minimum reload s–t path, trail and walk problems. Discrete Applied Mathematics. 158(13). 1404–1417. 21 indexed citations
13.
Escoffier, Bruno, et al.. (2009). Reoptimization of minimum and maximum traveling salesman’s tours. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine).
14.
Escoffier, Bruno, Laurent Gourvès, & Jérôme Monnot. (2009). Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Journal of Discrete Algorithms. 8(1). 36–49. 27 indexed citations
15.
Escoffier, Bruno & Jérôme Monnot. (2008). A better differential approximation ratio for symmetric TSP. Theoretical Computer Science. 396(1-3). 63–70. 4 indexed citations
16.
Werra, D. de, et al.. (2008). Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics. 157(4). 819–832. 16 indexed citations
17.
Monnot, Jérôme. (2006). A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs. Foundations of Computing and Decision Sciences. 169–173. 1 indexed citations
18.
Bazgan, Cristina, Refael Hassin, & Jérôme Monnot. (2004). Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics. 146(1). 27–42. 24 indexed citations
19.
Demange, Marco Kawamura, Jérôme Monnot, & Vangélis Th. Paschos. (2003). Differential approximation results for the Steiner tree problem. Applied Mathematics Letters. 16(5). 733–739. 1 indexed citations
20.
Demange, Marc, Jérôme Monnot, & Vangélis Th. Paschos. (1999). Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Applied Mathematics Letters. 12(7). 127–133. 11 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

Breakdown of academic impact, for papers by Alexander Ageev Breakdown of academic impact, for papers by Bettina Klinz Breakdown of academic impact, for papers by Vladimir G. Deı̌neko Breakdown of academic impact, for papers by Giulia Galbiati Breakdown of academic impact, for papers by Eranda Çela Breakdown of academic impact, for papers by Wolfgang Bein Breakdown of academic impact, for papers by Dror Rawitz Breakdown of academic impact, for papers by Olivier Goldschmidt Breakdown of academic impact, for papers by Kenji Onaga Breakdown of academic impact, for papers by Donald K. Wagner
Rankless by CCL
2026