| Distance labeling in graphs C Gavoille, D Peleg, S Pérennes, R Raz Journal of Algorithms 53 (1), 85-112, 2004 | 398 | 2004 |
| Graph problems arising from wavelength-routing in all-optical networks B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro INRIA, 1997 | 237 | 1997 |
| Memory requirement for routing in distributed networks C Gavoille, S Pérennes Proceedings of the fifteenth annual ACM symposium on Principles of …, 1996 | 125 | 1996 |
| Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro International Colloquium on Automata, Languages, and Programming, 574-585, 1996 | 124 | 1996 |
| Optimal information dissemination in star and pancake networks P Berthome, A Ferreira, S Perennes IEEE Transactions on Parallel and Distributed Systems 7 (12), 1292-1300, 1996 | 102 | 1996 |
| Shared risk resource group complexity and approximability issues D Coudert, P Datta, S Perennes, H Rivano, ME Voge Parallel Processing Letters 17 (02), 169-184, 2007 | 90 | 2007 |
| Hardness and approximation of gathering in static radio networks JC Bermond, J Galtier, R Klasing, N Morales, S Pérennes Parallel Processing Letters 16 (02), 165-183, 2006 | 81 | 2006 |
| Provably efficient algorithms for placement of service function chains with ordering constraints A Tomassilli, F Giroire, N Huin, S Pérennes IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 774-782, 2018 | 75 | 2018 |
| Colouring paths in directed symmetric trees with applications to WDM routing L Gargano, P Hell, S Perennes International Colloquium on Automata, Languages, and Programming, 505-515, 1997 | 66 | 1997 |
| Simultaneous edge flipping in triangulations J Galtier, F Hurtado, M Noy, S Pérennes, J Urrutia International Journal of Computational Geometry & Applications 13 (02), 113-133, 2003 | 60 | 2003 |
| The minimum range assignment problem on linear radio networks AEF Clementi, A Ferreira, P Penna, S Perennes, R Silvestri European symposium on algorithms, 143-154, 2000 | 59 | 2000 |
| Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro Theoretical computer science 233 (1-2), 165-189, 2000 | 57 | 2000 |
| Improved approximation results for the minimum energy broadcasting problem M Flammini, R Klasing, A Navarra, S Pérennes Algorithmica 49 (4), 318-336, 2007 | 55 | 2007 |
| A note on the dimensionality of modified Knödel graphs JC Bermond, HA Harutyunyan, AL Liestman, S Perennes International Journal of Foundations of Computer Science 8 (02), 109-116, 1997 | 54 | 1997 |
| The power of small coalitions in graphs JC Bermond, J Bond, D Peleg, S Perennes Discrete Applied Mathematics 127 (3), 399-414, 2003 | 50 | 2003 |
| Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem R Klasing, A Navarra, A Papadopoulos, S Pérennes International conference on research in networking, 866-877, 2004 | 48 | 2004 |
| On the complexity of bandwidth allocation in radio networks R Klasing, N Morales, S Pérennes Theoretical Computer Science 406 (3), 225-239, 2008 | 45 | 2008 |
| Rerouting requests in wdm networks D Coudert, S Pérennes, QC Pham, JS Sereni 7eme Rencontres Francophones sur les aspects Algorithmiques des …, 2005 | 43 | 2005 |
| Gossiping in Cayley graphs by packets JC Bermond, T Kodate, S Pérennes Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer …, 1995 | 41 | 1995 |
| Hamilton circuits in the directed wrapped butterfly network JC Bermond, E Darrot, O Delmas, S Perennes Discrete Applied Mathematics 84 (1-3), 21-42, 1998 | 38 | 1998 |
