Stéphane Pérennès

1.8k total citations
70 papers, 573 citations indexed

About

Stéphane Pérennès is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Stéphane Pérennès has authored 70 papers receiving a total of 573 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computer Networks and Communications, 36 papers in Computational Theory and Mathematics and 26 papers in Electrical and Electronic Engineering. Recurrent topics in Stéphane Pérennès's work include Interconnection Networks and Systems (27 papers), Advanced Graph Theory Research (25 papers) and Complexity and Algorithms in Graphs (15 papers). Stéphane Pérennès is often cited by papers focused on Interconnection Networks and Systems (27 papers), Advanced Graph Theory Research (25 papers) and Complexity and Algorithms in Graphs (15 papers). Stéphane Pérennès collaborates with scholars based in France, Austria and Italy. Stéphane Pérennès's co-authors include Cyril Gavoille, David Peleg, Ran Raz, Jean‐Claude Bermond, Ralf Klasing, Frédéric Giroire, Michele Flammini, Nelson Morales, Ignasi Sau and Omid Amini and has published in prestigious journals such as Computer Networks, Theoretical Computer Science and Computer Communications.

In The Last Decade

Stéphane Pérennès

66 papers receiving 546 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stéphane Pérennès France 12 409 239 159 69 47 70 573
Ralf Klasing France 14 462 1.1× 206 0.9× 117 0.7× 41 0.6× 11 0.2× 73 618
Lata Narayanan Canada 13 581 1.4× 133 0.6× 290 1.8× 42 0.6× 9 0.2× 85 682
Isaac D. Scherson United States 13 421 1.0× 98 0.4× 125 0.8× 95 1.4× 20 0.4× 86 579
Jaroslav Opatrný Canada 11 259 0.6× 139 0.6× 142 0.9× 49 0.7× 14 0.3× 43 368
Imrich Vrt’o Slovakia 12 149 0.4× 270 1.1× 142 0.9× 30 0.4× 45 1.0× 60 437
Curt Jones United States 4 238 0.6× 120 0.5× 239 1.5× 72 1.0× 15 0.3× 5 438
Frédéric Giroire France 13 541 1.3× 59 0.2× 237 1.5× 78 1.1× 34 0.7× 51 640
Ondřej Sýkora Slovakia 11 89 0.2× 175 0.7× 104 0.7× 49 0.7× 34 0.7× 47 328
Eliezer Dekel United States 7 252 0.6× 156 0.7× 67 0.4× 91 1.3× 11 0.2× 26 411
Tommy R. Jensen Germany 7 143 0.3× 481 2.0× 148 0.9× 21 0.3× 7 0.1× 20 627

Countries citing papers authored by Stéphane Pérennès

Since Specialization
Citations

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

Fields of papers citing papers by Stéphane Pérennès

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stéphane Pérennès. 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 Stéphane Pérennès. The network helps show where Stéphane Pérennès may publish in the future.

Co-authorship network of co-authors of Stéphane Pérennès

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphane Pérennès. A scholar is included among the top collaborators of Stéphane Pérennès 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 Stéphane Pérennès. Stéphane Pérennès 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.
Giroire, Frédéric, et al.. (2024). Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget. SPIRE - Sciences Po Institutional REpository. 961–970.
2.
Giroire, Frédéric, et al.. (2024). Scheduling with Fully Compressible Tasks: Application to Deep Learning Inference with Neural Network Compression. SPIRE - Sciences Po Institutional REpository. 327–336. 2 indexed citations
3.
Giroire, Frédéric, Damien Saucez, Stéphane Pérennès, et al.. (2021). Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Computer Networks. 192. 108043–108043. 5 indexed citations
4.
Cohen, Nathann, et al.. (2017). Spy-game on graphs: Complexity and simple topologies. Theoretical Computer Science. 725. 1–15. 3 indexed citations
5.
Amini, Omid, David Peleg, Stéphane Pérennès, Ignasi Sau, & Saket Saurabh. (2012). On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics. 160(12). 1661–1679. 18 indexed citations
6.
Bermond, Jean‐Claude, Michel Cosnard, & Stéphane Pérennès. (2012). Directed acyclic graphs with the unique dipath property. Theoretical Computer Science. 504. 5–11. 3 indexed citations
7.
Bermond, Jean‐Claude, David Coudert, Joanna Mouliérac, et al.. (2012). GMPLS label space minimization through hypergraph layouts. Theoretical Computer Science. 444. 3–16. 1 indexed citations
8.
Klasing, Ralf, Nelson Morales, & Stéphane Pérennès. (2008). On the complexity of bandwidth allocation in radio networks. Theoretical Computer Science. 406(3). 225–239. 17 indexed citations
9.
Coudert, David, et al.. (2006). Complexity and approximability issues of Shared Risk Resource Group. HAL (Le Centre pour la Communication Scientifique Directe). 20. 3 indexed citations
10.
Bermond, Jean‐Claude, et al.. (2002). Deadlock prevention by acyclic orientations. Discrete Applied Mathematics. 129(1). 31–47. 1 indexed citations
11.
Gavoille, Cyril, David Peleg, Stéphane Pérennès, & Ran Raz. (2001). Distance labeling in graphs. Symposium on Discrete Algorithms. 210–219. 61 indexed citations
12.
Heydemann, Marie-Claude, et al.. (2001). Complete Rotations in Cayley Graphs. European Journal of Combinatorics. 22(2). 179–196. 19 indexed citations
13.
Flammini, Michele & Stéphane Pérennès. (2001). On the Optimality of General Lower Bounds for Broadcasting and Gossiping. SIAM Journal on Discrete Mathematics. 14(2). 267–282. 4 indexed citations
14.
Pérennès, Stéphane. (1998). Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. Discrete Applied Mathematics. 83(1-3). 247–262. 9 indexed citations
15.
Bermond, Jean‐Claude, Luisa Gargano, & Stéphane Pérennès. (1998). Optimal sequential gossiping by short messages. Discrete Applied Mathematics. 86(2-3). 145–155. 10 indexed citations
16.
Hell, Pavol, et al.. (1998). Optimal wavelength-routed multicasting. Discrete Applied Mathematics. 84(1-3). 15–20. 10 indexed citations
17.
Pérennès, Stéphane. (1997). A proof of Jean de Rumeur's conjecture. Discrete Applied Mathematics. 74(3). 295–299. 1 indexed citations
18.
Gavoille, Cyril & Stéphane Pérennès. (1996). Lower Bounds for Shortest Path Interval Routing.. 183(40). 88–103. 3 indexed citations
19.
Bermond, Jean‐Claude, et al.. (1996). Hamilton Circuits in the Directed Butterfly Network. OpenGrey (Institut de l'Information Scientifique et Technique). 1 indexed citations
20.
Gavoille, Cyril & Stéphane Pérennès. (1996). Memory requirement for routing in distributed networks. 125–133. 36 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 Ralf Klasing Breakdown of academic impact, for papers by Lata Narayanan Breakdown of academic impact, for papers by Isaac D. Scherson Breakdown of academic impact, for papers by Jaroslav Opatrný Breakdown of academic impact, for papers by Imrich Vrt’o Breakdown of academic impact, for papers by Curt Jones Breakdown of academic impact, for papers by Frédéric Giroire Breakdown of academic impact, for papers by Ondřej Sýkora Breakdown of academic impact, for papers by Eliezer Dekel Breakdown of academic impact, for papers by Tommy R. Jensen
Rankless by CCL
2026