stephane perennes
stephane perennes
Verified email at - Homepage
Cited by
Cited by
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of algorithms 53 (1), 85-112, 2004
Graph problems arising from wavelength-routing in all-optical networks
B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro
WOCS 1997-2nd Workshop on Optics and Computer Science-11th International …, 1997
Efficient collective communication in optical networks
JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro
Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996
Memory requirement for routing in distributed networks
C Gavoille, S Pérennčs
Proceedings of the fifteenth annual ACM symposium on Principles of …, 1996
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
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
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
Hardness and approximation of gathering in static radio networks
JC Bermond, J Galtier, R Klasing, N Morales, S Perennes
Parallel Processing Letters 16 (02), 165-183, 2006
Colouring paths in directed symmetric trees with applications to WDM routing
L Gargano, P Hell, S Perennes
Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 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
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
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
The minimum range assignment problem on linear radio networks
AEF Clementi, A Ferreira, P Penna, S Perennes, R Silvestri
Algorithms-ESA 2000: 8th Annual European Symposium Saarbrücken, Germany …, 2000
Improved approximation results for the minimum energy broadcasting problem
M Flammini, A Navarra, R Klasing, S Pérennes
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 85-91, 2004
The power of small coalitions in graphs
JC Bermond, J Bond, D Peleg, S Perennes
Discrete Applied Mathematics 127 (3), 399-414, 2003
On the complexity of bandwidth allocation in radio networks
R Klasing, N Morales, S Pérennes
Theoretical Computer Science 406 (3), 225-239, 2008
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
Rerouting requests in wdm networks
D Coudert, S Pérennes, QC Pham, JS Sereni
7eme Rencontres Francophones sur les aspects Algorithmiques des …, 2005
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
Gossiping in Cayley graphs by packets
JC Bermond, T Kodate, S Pérennes
Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer …, 1995
The system can't perform the operation now. Try again later.
Articles 1–20