Éric Gourdin

801 total citations
31 papers, 507 citations indexed

About

Éric Gourdin is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Industrial and Manufacturing Engineering. According to data from OpenAlex, Éric Gourdin has authored 31 papers receiving a total of 507 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Networks and Communications, 13 papers in Electrical and Electronic Engineering and 9 papers in Industrial and Manufacturing Engineering. Recurrent topics in Éric Gourdin's work include Advanced Optical Network Technologies (10 papers), Vehicle Routing Optimization Methods (9 papers) and Software-Defined Networks and 5G (8 papers). Éric Gourdin is often cited by papers focused on Advanced Optical Network Technologies (10 papers), Vehicle Routing Optimization Methods (9 papers) and Software-Defined Networks and 5G (8 papers). Éric Gourdin collaborates with scholars based in France, Belgium and United States. Éric Gourdin's co-authors include Hande Yaman, Martine Labbé, Walid Ben‐Ameur, Nancy Perrot, Gilbert Laporte, Jasmina Omić, Daniele Catanzaro, Piet Van Mieghem, Jérémie Leguay and Lorenzo Maggi and has published in prestigious journals such as Operations Research, IEEE/ACM Transactions on Networking and Mathematical Programming.

In The Last Decade

Éric Gourdin

29 papers receiving 478 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Éric Gourdin France 12 236 216 147 134 87 31 507
Young‐Soo Myung South Korea 11 134 0.6× 211 1.0× 75 0.5× 145 1.1× 41 0.5× 28 484
Hervé Kerivin France 11 160 0.7× 127 0.6× 45 0.3× 158 1.2× 27 0.3× 30 413
Pierre Chardaire United Kingdom 10 74 0.3× 153 0.7× 90 0.6× 54 0.4× 48 0.6× 15 328
Eduardo G. Pardo Spain 13 96 0.4× 414 1.9× 38 0.3× 41 0.3× 87 1.0× 39 591
Dritan Nace France 12 296 1.3× 131 0.6× 37 0.3× 217 1.6× 19 0.2× 56 581
Artur Tomaszewski Poland 11 672 2.8× 83 0.4× 42 0.3× 582 4.3× 28 0.3× 51 987
A. Ridha Mahjoub France 13 149 0.6× 234 1.1× 46 0.3× 173 1.3× 15 0.2× 53 504
Igor Vasilyev Russia 11 50 0.2× 238 1.1× 139 0.9× 17 0.1× 51 0.6× 29 391
J. A. Moreno Spain 6 50 0.2× 247 1.1× 38 0.3× 21 0.2× 50 0.6× 13 392
Toshiharu Hasegawa Japan 12 219 0.9× 93 0.4× 32 0.2× 114 0.9× 20 0.2× 53 501

Countries citing papers authored by Éric Gourdin

Since Specialization
Citations

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

Fields of papers citing papers by Éric Gourdin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Éric Gourdin. 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 Éric Gourdin. The network helps show where Éric Gourdin may publish in the future.

Co-authorship network of co-authors of Éric Gourdin

This figure shows the co-authorship network connecting the top 25 collaborators of Éric Gourdin. A scholar is included among the top collaborators of Éric Gourdin 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 Éric Gourdin. Éric Gourdin 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.
Gourdin, Éric, et al.. (2023). Two extended formulations for the virtual network function placement and routing problem. Networks. 82(1). 32–51. 1 indexed citations
2.
Combes, Richard, et al.. (2021). Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. ACM SIGMETRICS Performance Evaluation Review. 49(1). 5–6. 1 indexed citations
3.
Ljubić, Ivana, et al.. (2021). Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Computers & Operations Research. 130. 105227–105227. 5 indexed citations
4.
Gourdin, Éric, et al.. (2020). Virtual Network Functions Placement and Routing Problem: Path formulation. 55–63. 7 indexed citations
5.
Gourdin, Éric, Deep Medhi, & Achille Pattavina. (2018). Design of reliable communication networks. Annals of Telecommunications. 73(1-2). 1–3. 11 indexed citations
6.
Borne, Sabine Le, et al.. (2018). A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem. Computers & Industrial Engineering. 124. 582–603. 1 indexed citations
7.
Perrot, Nancy, et al.. (2017). Virtual function placement for service chaining with partial orders and anti‐affinity rules. Networks. 71(2). 97–106. 43 indexed citations
8.
Gourdin, Éric, et al.. (2015). Optimal hierarchical deployment of caches for video streaming. 1–5. 1 indexed citations
9.
Ben‐Ameur, Walid, et al.. (2013). A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. Electronic Notes in Discrete Mathematics. 41. 311–318. 7 indexed citations
11.
Chrétienne, Philippe, et al.. (2012). The location-dispatching problem: Polyhedral results and content delivery network design. Discrete Applied Mathematics. 164. 68–85. 2 indexed citations
12.
Gourdin, Éric, et al.. (2010). On maximizing collaboration in Wireless Mesh Networks without monetary incentives. HAL (Le Centre pour la Communication Scientifique Directe). 402–411. 1 indexed citations
13.
Chrétienne, Philippe, et al.. (2010). The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Electronic Notes in Discrete Mathematics. 36. 867–874. 1 indexed citations
14.
Catanzaro, Daniele, et al.. (2010). A branch-and-cut algorithm for the partitioning-hub location-routing problem. Computers & Operations Research. 38(2). 539–549. 41 indexed citations
15.
Chrétienne, Philippe, et al.. (2007). Biclique completion problems for multicast network design. Discrete Optimization. 4(3-4). 360–377. 15 indexed citations
16.
Yaman, Hande, et al.. (2004). A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming. 102(2). 371–405. 104 indexed citations
17.
Ben‐Ameur, Walid & Éric Gourdin. (2003). Internet Routing and Related Topology Issues. SIAM Journal on Discrete Mathematics. 17(1). 18–49. 54 indexed citations
18.
Ameur, Walid Ben, et al.. (2003). Optimal routing for efficient Internet networks. 10–17. 2 indexed citations
19.
Gourdin, Éric, Martine Labbé, & Hande Yaman. (2002). Telecommunication and Location. HAL (Le Centre pour la Communication Scientifique Directe). 275–305. 38 indexed citations
20.
Gourdin, Éric, Martine Labbé, & Gilbert Laporte. (2000). The Uncapacitated Facility Location Problem with Client Matching. Operations Research. 48(5). 671–685. 34 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