Publications of Stéphane Pérennes
BACK TO COATI PUBLICATION INDEX
Publications of Stéphane Pérennes
-
S. Pérennes.
Contribution à l'algorithmique des réseaux de télécommunications.
Habilitation à Diriger des Recherches,
Université de Nice Sophia-Antipolis (UNS),
March 2010.
[WWW
] [bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
Algorithmica,
83(5):1459-1492,
2021.
[WWW
] [PDF
]
Keywords:
King's graph,
Strong grid,
Cartesian grid,
Grids,
Graphs,
Eternal Domination,
Combinatorial Games.
[bibtex-entry]
-
Andrea Tomassilli,
Giuseppe Di Lena,
Frédéric Giroire,
Issam Tahiri,
Damien Saucez,
Stéphane Pérennes,
Thierry Turletti,
Ruslan Sadykov,
François Vanderbeck,
and Chidung Lac.
Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme.
Computer Networks,
192(108043),
June 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Thibaud Trolliet,
Nathann Cohen,
Frédéric Giroire,
Luc Hogie,
and Stéphane Pérennes.
Interest clustering coefficient: a new metric for directed networks like Twitter.
Journal of Complex Networks,
2021.
[WWW
] [PDF
]
Keywords:
complex networks,
clustering coefficient,
directed networks,
social networks,
Twitter,
link recommendation.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Algorithmica,
82(10):2867-2901,
2020.
[WWW
] [PDF
]
Keywords:
Complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica,
82(2):212-244,
2020.
[WWW
] [PDF
]
Keywords:
Grid,
Tree,
Linear Programming,
Domination,
Graphs,
Spy game,
Cops and Robber games.
[bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
Algorithmica,
2020.
[WWW
] [PDF
]
Keywords:
King's graph,
Strong grid,
Cartesian grid,
Grids,
Graphs,
Eternal Domination,
Combinatorial Games.
[bibtex-entry]
-
Nathann Cohen,
Nicolas Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Spy-game on graphs: Complexity and simple topologies.
Theoretical Computer Science,
725:1 - 15,
May 2018.
[WWW
] [PDF
]
Keywords:
Graphs,
Cops and Robber games,
PSPACE-hard.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica,
August 2018.
[WWW
] [PDF
]
Keywords:
Domination,
Graphs,
Spy game,
Cops and Robber games,
Linear Programming,
Tree,
Grid.
[bibtex-entry]
-
Frédéric Giroire,
Remigiusz Modrzejewski,
Nicolas Nisse,
and Stéphane Pérennes.
Maintaining Balanced Trees for Structured Distributed Streaming Systems.
Discrete Applied Mathematics,
232:176 - 188,
December 2017.
[WWW
] [PDF
]
Keywords:
Peer-to-peer,
Distributed Live Streaming System,
Graph Algorithm,
Balanced Trees.
[bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
Grid spanners with low forwarding index for energy efficient networks.
Discrete Applied Mathematics,
March 2017.
[WWW
] [PDF
]
Keywords:
grid,
routing,
energy saving,
spanning subgraphs,
forwarding index.
[bibtex-entry]
-
Euripides Markou,
Nicolas Nisse,
and Stéphane Pérennes.
Exclusive graph searching vs. pathwidth.
Information and Computation,
252:243 - 260,
2017.
[WWW
] [PDF
]
Keywords:
graph searching,
pathwidth.
[bibtex-entry]
-
David Coudert,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Combinatorial optimization in networks with Shared Risk Link Groups.
Discrete Mathematics and Theoretical Computer Science,
Vol. 18, no 3:25,
May 2016.
[WWW
] [PDF
]
Keywords:
colored graphs,
Shared Risk Link Group,
complexity,
algorithms,
Multi-layer networks.
[bibtex-entry]
-
Frédéric Giroire,
Ioannis Lamprou,
Dorian Mazauric,
Nicolas Nisse,
Stéphane Pérennes,
and Ronan Soares.
Connected Surveillance Game.
Journal of Theoretical Computer Science (TCS),
584:131-143,
June 2015.
[WWW
] [PDF
]
Keywords:
Surveillance game,
Cops and robber games,
Prefetching,
Online strategy,
Competitive ratio,
Cost of connectivity.
[Abstract] [bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
On the complexity of equal shortest path routing.
Networks,
2015.
[WWW
] [PDF
]
Keywords:
shortest path,
routing,
OSPF-ECMP protocol,
maximum flow,
NP-hard,
approximation algorithms,
inverse shortest path.
[Abstract] [bibtex-entry]
-
Julio Araujo,
Nicolas Nisse,
and Stéphane Pérennes.
Weighted Coloring in Trees.
Siam Journal on Discrete Mathematics,
28(4):2029 - 2041,
2014.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
and S. Pérennes.
Directed acyclic graphs with the unique dipath property.
Theoretical Computer Science,
504:5-11,
September 2013.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A. A. Rescigno,
and U. Vaccaro.
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas.
Journal of Theoretical Computer Science (TCS),
509:122-139,
October 2013.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
R. Klasing,
N. Morales,
S. Pérennes,
and P. Reyes.
Gathering radio messages in the path.
Discrete Mathematics, Algorithms and Applications,
5(1):1-28,
March 2013.
[WWW
] [PDF
] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Study of Different Placement Policies.
Peer-to-Peer Networking and Applications,
March 2013.
[WWW
] [PDF
] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
On the approximability of some degree-constrained subgraph problems.
Discrete Applied Mathematics,
160(12):1661 - 1679,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Pérennes,
I. Sau,
and F. Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts.
Theoretical Computer Science (TCS),
444:3-16,
July 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
S. Pérennes,
and H. Rivano.
Framework for Optimizing the Capacity of Wireless Mesh Networks.
Computer Communications,
34(13):1645-1659,
2011.
[WWW
]
Keywords:
Wireless mesh networks,
capacity,
routing,
scheduling,
linear programming,
column and cut generation..
[Abstract] [bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Networks,
55(4):326-340,
July 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica,
58(2):516-540,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
and S. Pérennes.
On the pathwidth of planar graphs.
SIAM Journal of Discrete Mathematics,
23(3):1311-1316,
August 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Theoretical Computer Science,
410(38-40):3751-3760,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
A. Jarry and S. Pérennes.
Disjoint Path in symmetric Graphs.
Discrete Applied Mathematics,
157(1):90-97,
2009.
[bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Algorithmic Operations Research (AlgOR),
4(2):133-143,
2009.
[Abstract] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Tightening the Upper Bound for the Minimum Energy Broadcasting problem.
Wireless Networks,
14(5):659--669,
October 2008.
Note: Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005).
[WWW
] [bibtex-entry]
-
M. Flammini,
L. Moscardelli,
A. Navarra,
and S. Pérennes.
Asymptotically Optimal Solutions for Small World Graphs.
Theory of Computing Systems,
42(4):632-650,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Klasing,
N. Morales,
and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks.
Theoretical Computer Science,
406(3):225-239,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Ferreira,
S. Pérennes,
and J. Peters.
Neighbourhood Broadcasting in Hypercubes.
SIAM Journal on Discrete Mathematics,
21(4):823-843,
2007.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
P. Datta,
S. Perennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Group: Complexity and Approximability issues.
Parallel Processing Letters,
17(2):169-184,
June 2007.
[PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting problem.
Algorithmica,
49(4):318-336,
2007.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of Gathering in static radio networks.
Parallel Processing Letters,
16(2):165--183,
2006.
[PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
A. Navarra,
and S. Pérennes.
The Real Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting.
ACM Journal of Experimental Algorithmics,
11:1--13,
2006.
Note: (Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005)).
[bibtex-entry]
-
S. Choplin,
A. Jarry,
and S. Pérennes.
Virtual network embedding in the cycle.
Discrete Applied Mathematics,
145(3):368--375,
2005.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower bounds on systolic gossip.
Information and Computation,
196(2):71--94,
2005.
[bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
P. Persiano,
and H. Rivano.
Approximate Constrained Bipartite Edge Coloring.
Discrete Applied Mathematics,
143(1-3):54--61,
September 2004.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols.
SIAM Journal on Discrete Mathematics,
17(4):521--540,
2004.
[PDF
] [bibtex-entry]
-
C. Gavoille,
D. Peleg,
S. Pérennes,
and R. Raz.
Distance labeling in Graphs.
Journal of Algorithms,
53(1):85--112,
2004.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
J. Bond,
D. Peleg,
and S. Pérennes.
The power of small coalitions in graphs.
Discrete Applied Mathematics, Editor's Choice,
127(3):399-414,
2003.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
S. Choplin,
and S. Pérennes.
Hierarchical ring networks design.
Theory of Computing Systems,
36(6):663--682,
2003.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
M. Di Ianni,
M. Flammini,
and S. Pérennes.
Acyclic orientations for deadlock prevention in usual networks.
Discrete Applied Mathematics,
129(1):31--47,
2003.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Directed Virtual Path Layout in ATM networks.
Theoretical Computer Science,
291(1):3--28,
2003.
[PDF
] [bibtex-entry]
-
A. Clementi,
A. Ferreira,
P. Penna,
S. Pérennes,
and R. Silvestri.
The Minimum Range Assignment Problem on Linear Radio Networks.
Algorithmica,
35(2):95--110,
2003.
[bibtex-entry]
-
A. Ferreira,
S. Pérennes,
A. W. Richa,
H. Rivano,
and N. Stier.
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.
Telecommunication Systems,
24(2):123--138,
October 2003.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Galtier,
F. Hurtado,
M. Noy,
S. Pérennes,
and J. Hurrutia.
Simultaneous edge flipping in triangulations.
International Journal of Computational Geometry and Applications,
13(2):113--133,
2003.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Pérennes.
Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks.
Networks (Wiley-Interscience),
40(3):155-164,
October 2002.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
B. Beauquier,
O. Delmas,
and S. Pérennes.
Tight Bounds for Broadcasting in the Linear Cost Model.
Journal of Interconnection Network,
2(2):175--188,
2001.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
On the optimality of general lower bounds for broadcasting and gossiping.
SIAM J. Discrete Math.,
14(2):267--282,
2001.
[bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown network with a leader.
Distributed Computing,
14(3):163--183,
2001.
[bibtex-entry]
-
L. Gargano,
P. Hell,
and S. Pérennes.
Coloring all directed paths in a symmetric tree, with an application to optical networks.
Journal of Graph Theory,
38(4):183--196,
2001.
[bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Efficient communication in unknown networks.
Networks,
38(1):39--49,
2001.
[bibtex-entry]
-
M.-C. Heydemann,
N. Marlin,
and S. Pérennes.
Complete Rotations in Cayley Graphs.
European Journal of Combinatorics,
22(2):179-196,
2001.
[WWW
] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Efficient Collective Communications in Optical Networks.
Theoretical Computer Science,
233(1-2):165--189,
2000.
[PDF
] [bibtex-entry]
-
P. Berthomé,
A. Ferreira,
S. Pérennes,
G. Plaxton,
and B. Maggs.
Sorting-based selection algorithms on hypercubic networks.
Algorithmica,
26(2):237--254,
2000.
[bibtex-entry]
-
J-C. Bermond,
A. Bonnecaze,
T. Kodate,
S. Pérennes,
and P. Solé.
Symetric flows and broadcasting in hypercubes.
Annales de l'Institut Fourier,
49:787-807,
1999.
[PDF
] [bibtex-entry]
-
B. Beauquier,
P. Hell,
and S. Pérennes.
Optimal Wavelength-routed Multicasting.
DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science,
84(1-3),
May 1998.
[WWW
] [bibtex-entry]
-
J-C. Bermond,
E. Darrot,
O. Delmas,
and S. Pérennes.
Hamilton circuits in the directed wrapped butterfly network.
Discrete Applied Mathematics,
84(1-3):21-42,
1998.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
E. Darrot,
O. Delmas,
and S. Pérennes.
Hamilton cycle decomposition of the butterfly networks.
Parallel Processing Letters,
8(3):371-385,
1998.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
and S. Pérennes.
Optimal sequential gossiping by short messages.
Discrete Applied Mathematics,
86(2-3):145-155,
1998.
[PDF
] [bibtex-entry]
-
S. Perennes.
Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks..
Discrete Applied Mathematics,
83:247-262,
1998.
[bibtex-entry]
-
J-C. Bermond,
H.A. Harutyunyan,
A.L. Liestman,
and S. Pérennes.
A note on the dimensionalityof modified Knödel Graphs.
International Journal of Foundations of Computer Science,
8(2):109-116,
1997.
[PDF
] [bibtex-entry]
-
S. Perennes.
A Proof of Jean de Rumeur's conjecture.
Discrete Applied Mathematics,
74:295-299,
1997.
[bibtex-entry]
-
P. Berthomé,
A. Ferreira,
and S. Pérennes.
Decomposing hierarchical Cayley graphs, with applications to information dissemination and algorithm design.
IEEE Transactions on Parallel and Distributed Systems,
7(12):1292--1300,
December 1996.
[bibtex-entry]
-
Thibaud Trolliet,
Frédéric Giroire,
and Stéphane Pérennes.
Un modèle de graphes aléatoires croissants pour n'importe quelle distribution des degrés.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Systèmes Complexes,
Modélisation,
Attachement Préférentiel,
Distribution des degrés,
Twitter.
[bibtex-entry]
-
Guillaume Ducoffe,
Frédéric Giroire,
Stéphane Pérennes,
and Thibaud Trolliet.
Revisiter l'Attachement Préférentiel, et ses applications aux Réseaux Sociaux.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
Twitter,
Réseaux sociaux,
Graphes aléatoires,
Systèmes complexes,
Attachement préférentiel,
Distribution des degrés,
Chaines de Markov.
[bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Thibaud Trolliet.
A Random Growth Model with any Real or Theoretical Degree Distribution.
In COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications,
Madrid / Virtual, Spain,
December 2020.
[WWW
] [PDF
]
Keywords:
Complex Networks,
Random Growth Model,
Preferential Attachment,
Degree Distribution,
Twitter.
[bibtex-entry]
-
Thibaud Trolliet,
Nathann Cohen,
Frédéric Giroire,
Luc Hogie,
and Stéphane Pérennes.
Coefficient de Clustering d'intérêt : une nouvelle métrique pour les graphes dirigés comme Twitter.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
Systèmes Complexes,
Coefficient de Clustering,
Graphes Dirigés,
Réseaux Sociaux,
Twitter.
[bibtex-entry]
-
Thibaud Trolliet,
Nathann Cohen,
Frédéric Giroire,
Luc Hogie,
and Stéphane Pérennes.
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter.
In COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications,
Madrid / Virtual, Spain,
December 2020.
[WWW
] [PDF
]
Keywords:
Complex networks,
Clustering Coefficient,
Directed networks,
Social networks,
Twitter.
[bibtex-entry]
-
Frédéric Giroire,
Nicolas Huin,
Andrea Tomassilli,
and Stéphane Pérennes.
When Network Matters: Data Center Scheduling with Network Tasks.
In INFOCOM 2019 - IEEE International Conference on Computer Communications,
Paris, France,
April 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination in Grids.
In CIAC 2019 - 11th International Conference on Algorithms and Complexity,
volume 11485 of Algorithms and Complexity. Lecture Notes in Computer Science,
Rome, Italy,
pages 311-322,
May 2019.
[WWW
] [PDF
]
Keywords:
Grids,
Combinatorial Games,
Graphs,
Eternal Domination.
[bibtex-entry]
-
Andrea Tomassilli,
Giuseppe Di Lena,
Frédéric Giroire,
Issam Tahiri,
Damien Saucez,
Stéphane Pérennes,
Thierry Turletti,
Ruslan Sadykov,
François Vanderbeck,
and Chidung Lac.
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
In CloudNet 2019 - 8th IEEE International Conference on Cloud Networking,
Coimbra, Portugal,
November 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
In 16th Workshop on Approximation and Online Algorithms (WAOA 2018),
Helsinki, Finland,
August 2018.
[WWW
] [PDF
]
Keywords:
metric dimension,
Games in graphs,
complexity.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Localiser une cible dans un graphe.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Mots-clefs : Graphes,
Dimension Métrique,
Dimension Centro¨idaleCentro¨idale,
Jeux dans les graphes.
[bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.
In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications,
Honolulu, United States,
April 2018.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Algorithmes d'approximation pour le placement de chaînes de fonctions de services avec des contraintes d'ordre.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Virtualisation des fonctions réseaux,
chaînes de fonctions de service,
Réseaux logiciels,
Optimisation.
[bibtex-entry]
-
Nathann Cohen,
Nìcolas A Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Enquêter dans les graphes.
In ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Quiberon, France,
May 2017.
[WWW
] [PDF
]
Keywords:
Jeu de Gendarmes et Voleur,
Programmation Linéaire,
Mots-clefs : Jeux combinatoires à deux joueurs dans les graphes.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a combinatorial game in graphs through Linear Programming.
In 28th International Symposium on Algorithms and Computation (ISAAC 2017),
Phuket, Thailand,
2017.
[WWW
] [PDF
]
Keywords:
Turn-by-turn games in graphs,
Graph algorithms,
Linear Programming.
[bibtex-entry]
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin Packing with Colocations.
In Klaus Jansen and Monaldo Mastrolilli, editors,
14th International Workshop on Approximation and Online Algorithms (WAOA),
volume 10138,
Aarhus, Denmark,
pages 40-51,
August 2016.
Springer.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Mathieu Hilaire,
Nicolas Martins,
Nicolas Nisse,
and Stéphane Pérennes.
Spy-Game on graphs.
In Erik D. Demaine and Fabrizio Grandoni, editors,
8th International Conference on Fun with Algorithms, FUN 2016,
volume 49 of Leibniz International Proceedings in Informatics (LIPIcs),
La Maddalena, Maddalena Islands, Italy,
2016.
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Giroire,
Stephane Perennes,
and Issam Tahiri.
Grid spanners with low forwarding index for energy efficient networks.
In International Network Optimization Conference (INOC),
Electronic Notes in Discrete Mathematics,
Warsaw, Poland,
May 2015.
[WWW
] [PDF
]
Keywords:
spanning subgraphs,
forwarding index,
energy saving,
routing,
grid.
[Abstract] [bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
How to design graphs with low forwarding index and limited number of edges.
In 26th International Workshop on Combinatorial Algorithms (IWOCA 2015),
Verona, Italy,
October 2015.
[WWW
] [PDF
]
Keywords:
graphs,
forwarding index,
routing,
design problem,
energy efficiency,
extremal graphs.
[Abstract] [bibtex-entry]
-
Julio Araújo,
Nicolas Nisse,
and Stéphane Pérennes.
Weighted Coloring in Trees.
In 31st Symposium on Theoretical Aspects of Computer Science (STACS),
Lyon, France,
pages 75-86,
March 2014.
Dagstuhl Publishing.
[WWW
] [PDF
] [bibtex-entry]
-
D. Agarwal,
J. Araujo,
C. Caillouet,
F. Cazals,
D. Coudert,
and S. Perennes.
Connectivity Inference in Mass Spectrometry based Structure Determination.
In H.L. Bodlaender and G.F. Italiano, editors,
European Symposium on Algorithms,
volume 8125 of Lecture Notes in Computer Science - LNCS,
Sophia-Antipolis, France, France,
pages 289-300,
2013.
Springer.
[WWW
] [bibtex-entry]
-
F. Giroire,
S. Gupta Kumar,
R. Modrzejewski,
J. Monteiro,
and S. Perennes.
Repair Time in Distributed Storage Systems.
In 6th International Conference on Data Management in Cloud, Grid and P2P Systems (Globe 2013),
volume 8059,
Prague, Czech Republic,
pages 99-110,
August 2013.
Springer.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Soares.
Connected Surveillance Game.
In 20th Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume LNCS 8179 of Lecture Notes in Computer Science (LNCS),
Ischia, Italy,
pages pages 68-79,
2013.
Springer.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
R. Modrzejewski,
N. Nisse,
and S. Pérennes.
Maintaining Balanced Trees For Structured Distributed Streaming Systems.
In 20th Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume LNCS 8179,
Ischia, Italy,
pages pages 177-188,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
S. Pérennes,
and I. Tahiri.
On the Hardness of Equal Shortest Path Routing.
In International Network Optimization Conference,
volume 41 of Electronic Notes in Discrete Mathematics,
Tenerife, Spain,
pages 439-446,
2013.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
S. Pérennes,
and I. Tahiri.
Sur la complexité du routage OSPF.
In N. Nisse,
Franck Rousseau,
and Yann Busnel, editors,
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel),
Pornic, France,
pages 1-4,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
L. Hogie,
A. Lancin,
D. Papadimitriou,
S. Pérennes,
and I. Tahiri.
Feasibility study on distributed simulations of BGP.
In PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012,
Zhangjiajie, Chine,
April 2012.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Optimal Time Data Gathering in Wireless Networks
with Omni-Directional Antennas.
In SIROCCO 2011,
volume 6796 of Lecture Notes in Computer Science,
Gdansk, Poland,
pages 306-317,
June 2011.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
F. Huc,
N. Nisse,
S. Pérennes,
and H. Rivano.
Stability of a localized and greedy routing algorithm.
In 12th Workshop on Advances in Parallel and Distributed Computational Models,
pages 8p,
2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
S. Perennes,
and H. Rivano.
Cross line and column generation for the cut covering problem in wireless networks.
In International Symposium on Combinatorial Optimization (ISCO),
pages 8p,
March 2010.
Note: To appear.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
Data Life Time for Different Placement Policies in P2P Storage Systems.
In Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe),
volume 6265 of Lecture Notes in Computer Science,
Bilbao, Spain,
pages 75--88,
September 2010.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and S. Pérennes.
Computing the average path length and a label-based routing in a small-world graph.
In 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'10),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
Recursive graph,
Labeling scheme,
Decentralized routing.
[Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy.
In Proceedings of the IEEE Global Communications Conference (GLOBECOM),
Miami, EUA,
pages 1-6,
12 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Monteiro and S. Pérennes.
Systèmes de stockage P2P : un guide pratique.
In 11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
Sophia Antipolis France,
pages 15--20,
2010.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
H. Rivano,
I. Sau,
and F. Solano Donado.
MPLS label stacking on the line network.
In L. Fratta et al., editor,
IFIP Networking,
volume 5550 of Lecture Notes in Computer Science,
Aachen, Germany,
pages 809-820,
May 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
Designing Hypergraph Layouts to GMPLS Routing Strategies.
In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 5869 of Lecture Notes in Computer Science,
Piran, Slovenia,
pages 57--71,
May 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair.
In Augustin Chaintreau and Clemence Magnien, editors,
11ème rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel'2009),
Carry-Le-Rouet France,
pages 4p,
2009.
Note: Best Student Paper Award.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems.
In Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P),
pages 184--193,
September 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?.
In Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN),
pages 320--323,
October 2009.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance evaluation,
data durability.
[Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems : Hardness and Approximation Results.
In 6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008),
volume 5426 of Lecture Notes in Computer Science,
Karlsruhe, Germany,
pages 29-42,
September 2008.
[PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
S. Pérennes,
P. Reyes,
and H. Rivano.
Bandwidth Allocation in Radio Grid Networks.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
S. Pérennes,
and H. Rivano.
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks.
In 4th IEEE Workshop on Broadband Wireless Access (BWA),
New-Orleans, US,
pages 6p,
December 2008.
[PDF
] [Abstract] [bibtex-entry]
-
C. Molle,
F. Peix,
S. Pérennes,
and H. Rivano.
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information.
In C. Kaklamanis and F. Nielson, editors,
the fourth Symposium on Trustworthy Global Computing (TGC 2008),
volume 5474 of Lecture Notes in Computer Science,
Barcelona, Spain,
pages 171-185,
November 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle,
F. Peix,
S. Pérennes,
and H. Rivano.
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
In The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
volume 4835 of Lecture Notes in Computer Science,
Sendai, Japan,
pages 561-573,
December 2007.
Springer-Verlag.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness of Approximating the Traffic Grooming.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 45-48,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
F. Giroire,
and S. Pérennes.
Design of Minimal Fault Tolerant On-Board Networks : Practical constructions.
In 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07),
volume 4474 of Lecture Notes in Computer Sciences,
Castiglioncello, Italy,
pages 261-273,
June 2007.
[PDF
] [bibtex-entry]
-
O. Amini,
J-C. Bermond,
F. Giroire,
F. Huc,
and S. Pérennes.
Design of Minimal Fault Tolerant Networks: Asymptotic Bounds.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 37--40,
May 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
D. Coudert,
and S. Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
In Advanced International Conference on Telecommunications (AICT),
pages 6p,
2006.
IEEE.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of Gathering in static radio networks.
In FAWN06,
Pisa, Italy,
pages 75--79,
March 2006.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Gathering in specific radio networks.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 85--88,
May 2006.
[WWW
] [PDF
] [bibtex-entry]
-
R. Cilibrasi,
Z. Lotker,
A. Navarra,
S. Pérennes,
and P. Vitanyi.
About the Lifespan of Peer to Peer Networks.
In Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS),
volume 4305 of Lecture Notes in Computer Science,
Bordeaux,
pages 290--304,
December 2006.
Springer-Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
S. Pérennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Groups and Survivability in Multilayer Networks.
In IEEE-LEOS ICTON / COST 293 GRAAL,
volume 3,
pages 235-238,
June 2006.
Note: Invited Paper.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
S. Perennes,
Q-C. Pham,
and J-S. Sereni.
Rerouting requests in WDM networks.
In AlgoTel'05,
Presqu'île de Giens, France,
pages 17-20,
mai 2005.
[PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
L. Moscardelli,
A. Navarra,
and S. Pérennes.
Asymptotically Optimal Solutions for Small World Graphs.
In Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005),
volume 3724 of Lecture Notes in Computer Science,
pages 414--428,
September 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
M. Flammini,
A. Navarra,
and S. Pérennes.
The Real approximation factor of the MST heuristic for the Minimum Energy Broadcasting.
In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005),
volume 3503 of Lecture Notes in Computer Science,
pages 22--31,
May 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005),
volume 3827 of Lecture Notes in Computer Science,
pages 757--766,
December 2005.
Springer Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting Problem.
In 2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALM-POMC 2004),
pages 85--91,
2004.
ACM Press.
[WWW
] [POSTSCRIPT
] [bibtex-entry]
-
R. Klasing,
A. Navarra,
A. Papadopoulos,
and S. Pérennes.
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem.
In Proc. 3rd FIP-TC6 Networking Conference ( Networking 2004),
volume 3042 of Lecture Notes in Computer Science,
pages 866--877,
2004.
Springer-Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
Z. Lotker,
M. Martinez de Albeniz,
and S. Pérennes.
Range-Free Ranking in Sensors Networks and Its Applications to Localization.
In ADHOC-NOW 2004,
pages 158--171,
2004.
[POSTSCRIPT
] [bibtex-entry]
-
J-C. Bermond,
O. Delmas,
F. Havet,
M. Montassier,
and S. Pérennes.
Réseaux de télécommunications minimaux embarqués tolérants.
In Conference ALGOTEL2003, Banyuls, May 2003,
pages 27--32,
2003.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
O. DeRivoyre,
S. Pérennes,
and M. Syska.
Groupage par tubes.
In Conference ALGOTEL2003, Banyuls, May 2003,
pages 169--174,
2003.
[PDF
] [bibtex-entry]
-
A. Ferreira,
S. Perennes,
A.W. Richa,
H. Rivano,
and N. Stier Moses.
Models, complexity and algorithms for the design of multifiber WDM networks.
In Telecommunications, 2003. ICT 2003. 10th International Conference on,
volume 1,
pages 12--18,
23 Feb.-1 March 2003.
[PDF
] [Abstract] [bibtex-entry]
-
J.-F. Lalande,
S. Pérennes,
and M. Syska.
Groupage dans les réseaux dorsaux WDM.
In ROADEF 2003,
number 5 of Proceedings in Informatics,
Avignon, France,
pages 254--255,
June 2003.
Université d'Avignon et des Pays de Vaucluse.
[bibtex-entry]
-
J-C. Bermond,
S. Choplin,
and S. Pérennes.
Hierarchical Ring Network Design.
In 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02),
pages 1--16,
2002.
Carleton Scientific.
[bibtex-entry]
-
A. Ferreira,
S. Pérennes,
A. Richa,
H. Rivano,
and N. Stier.
On the design of multifiber WDM networks.
In AlgoTel'02,
Mèze, France,
pages 25--32,
May 2002.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
G. Huiban,
S. Pérennes,
and M. Syska.
Traffic Grooming in WDM Networks with Multi-Layer Switches.
In IEEE ICC,
New-York,
April 2002.
Note: CD-Rom.
[bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
P. Persiano,
and H. Rivano.
Approximate Constrained Bipartite Edge Coloring.
In V.B. Le A. Branstädt, editor,
27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01),
volume 2204 of Lecture Notes in Computer Science,
Boltenhagen, Germany,
pages 21--31,
June 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional path coloring on bounded degree trees.
In F. Orejas,
P. G. Spirakis,
and J. van Leeuwen, editors,
Proceedings of the 28th ICALP,
volume 2076 of Lecture Notes in Computer Science,
Crete, Greece,
pages 732--743,
July 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
C. Gavoille,
D. Peleg,
S. Pérennes,
and R. Raz.
Distance Labeling in Graphs.
In SODA'01,
pages 210--219,
2001.
[bibtex-entry]
-
B. Beauquier,
K.S. Candan,
A. Ferreira,
S. Pérennes,
and A. Sen.
On shortest path problems with ``non-Markovian'' link contribution to path lengths.
In Proc. of IFIP/TC6 Networking 2000 Conference,
Paris, France,
mai 2000.
[bibtex-entry]
-
J-C. Bermond,
A. Bonnecaze,
T. Kodate,
S. Perennes,
and P. Sole.
Broadcasting in hypercubes in the circuit switched model.
In Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000,
pages 21-26,
2000.
[PDF
] [bibtex-entry]
-
A. Clementi,
A. Ferreira,
P. Penna,
S. Pérennes,
and R. Silvestri.
The Minimum Range Assignment Problem on Linear Radio Networks.
In Proc. of ESA-00, 8th Annual European Symposium on Algorithms,
volume LNCS,
pages 143--154,
2000.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
De Bruijn Isomorphisms and Free Space Optical Networks.
In IEEE International Parallel and Distributed Processing Symposium,
pages 769-774,
2000.
IEEE Press.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
A. Ferreira,
J. Galtier,
and S. Pérennes.
Approximation of a straight line in a bounded lattice.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 53--58,
Mai 2000.
[bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown anonymous networks.
In Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING),
pages 101--112,
2000.
[bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Efficient communication in unknown networks.
In Proc. of WG'2000 - 26th International Workshop on Graph-Theoretic Concepts in Computer Science,
2000.
Note: A paraître.
[bibtex-entry]
-
M.-C. Heydemann,
N. Marlin,
and S. Pérennes.
Rotational Cayley Graphs on Transposition Generated Groups (Extended Abstract).
In 6ème Colloque International de Théorie des Graphes,
Electronical Notes in Discrete Mathematics,
pages 187--190,
2000.
Elsevier Science.
[bibtex-entry]
-
B. Beauquier,
S. Pérennes,
and D. Tóth.
All-to-All Routing and Coloring in Weighted Trees of Rings.
In Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA),
Saint-Malo, France,
pages 185-190,
June 1999.
ACM Press.
[bibtex-entry]
-
J-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Virtual path layouts with low congestion or low diameter in ATM networks.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 77-82,
May 1999.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture.
In Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel,
Roscoff, France,
pages 101-106,
5-7 Mai 1999.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J. Galtier and S. Pérennes.
Parallel flips on planar triangulations.
In 15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins,
pages 80-86,
1999.
[bibtex-entry]
-
J-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Directed virtual path layouts in ATM networks.
In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499,
pages 75-i88. (Full version appeared in TCS),
1998.
Springer Verlag.
[bibtex-entry]
-
J-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Virtual path layouts in simple ATM networks.
In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998,
1998.
[bibtex-entry]
-
B. Beauquier,
J-C. Bermond,
L. Gargano,
P. Hell,
S. Perennes,
and U. Vaccaro.
Graph problems arising from Wavelength--Routing in All--Optical Networks.
In Proc. Conference WOCS97, Geneva,April 1997,
1997.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
J. Bond,
D. Peleg,
and S. Pérennes.
Tight bounds on the size of 2-monopolies.
In Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6,
pages 170--179,
1997.
Carleton U. Press.
[bibtex-entry]
-
J-C. Bermond,
M. Di Ianni,
M. Flammini,
and S. Pérennes.
Systolic orientations for deadlock prevention in usual networks.
In Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science,
volume 1335,
pages 52--64,
1997.
Springer verlag.
[bibtex-entry]
-
L. Gargano,
P. Hell,
and S. Pérennes.
Colouring paths in directed symmetric trees with applications to WDM routing.
In ICALP'97,
volume 1256 of Lecture Notes in Computer Science,
Bologna, Italy,
pages 505--515,
July 1997.
Springer-Verlag.
[bibtex-entry]
-
F. Baude,
F. Belloncle,
J-C. Bermond,
D. Caromel,
O. Dalle,
E. Darrot,
O. Delmas,
N. Furmento,
B. Gaujal,
P. Mussi,
S. Pérennes,
Y. Roudier,
G. Siegel,
and M. Syska.
The it SLOOP project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks.
In 2nd European School of Computer Science, Parallel Programming Environments for High Performance Computing it ESPPE'96,
Alpe d'Huez,
pages 85--88,
April 1996.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Efficient Collective Communications in Optical Networks.
In Proc.23nd ICALP96, Paderborn, Germany Lecture Notes in Computer Science, 1099,
pages 574--585,
1996.
Springer verlag.
[POSTSCRIPT
] [bibtex-entry]
-
J-C. Bermond,
T. Kodate,
and S. Perennes.
Gossiping in Cayley graphs by packets.
In Proceedings of the Franco-Japanese conference Brest July 95,
volume Lecture Notes in Computer Science, 1120,
pages 301-315,
1996.
Springer verlag.
[PDF
] [bibtex-entry]
-
C. Gavoille and S. Pérennes.
Memory Requirements for Routing in Distributed Networks (Extended Abstract).
In PODC,
pages 125-133,
1996.
Note: Best student paper award.
[bibtex-entry]
-
C. Gavoille and S. Pérennes.
Lower Bounds for Shortest Path Interval Routing.
In N. Santoro and P. G. Spirakis, editors,
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity,
Siena, Italy,
pages 88-103,
June 1996.
[bibtex-entry]
-
J-C. Bermond and S. Pérennes.
Efficient broadcasting protocols on de Bruijn and similar networks.
In Proc. Conference SIROCCO95, Olympie June 95, International Informatics Series 2,
pages 199--209,
1995.
Carleton U. Press.
[PDF
] [bibtex-entry]
-
P. Berthomé,
A. Ferreira,
B. Maggs,
S. Perennes,
and G. Plaxton.
Sorting-based selection algorithms on hypercubic networks.
In Proceedings of the 7th IEEE International Parallel Processing Symposium -- IPPS'93,
pages 89--95,
1993.
IEEE Press.
[bibtex-entry]
-
P. Berthomé,
A. Ferreira,
and S. Perennes.
Improved algorithm design and optimal information dissemination in Star and Pancake networks.
In Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing -- SPDP'93,
pages 720--723,
December 1993.
IEEE Press.
[bibtex-entry]
-
Andrea Tomassilli,
Giuseppe Di Lena,
Frédéric Giroire,
Issam Tahiri,
Damien Saucez,
Stéphane Perennes,
Thierry Turletti,
Ruslan Sadykov,
François Vanderbeck,
and Chidung Lac.
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
Research Report,
INRIA Sophia Antipolis - I3S,
April 2019.
[WWW
] [PDF
]
Keywords:
network resilience strategies,
Network Function Virtualization,
Software Defined Networking.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Research Report,
Inria,
2018.
[WWW
] [PDF
]
Keywords:
complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination in Grids.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Eternal Domination,
Combinatorial Games,
Graphs,
Grids.
[bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.
Research Report RR-9141,
Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis,
January 2018.
[WWW
] [PDF
]
Keywords:
network function virtualization,
service function chaining,
placement,
approximation algorithms,
Réseaux logiciels,
Optimisation,
Virtualisation des fonctions réseaux,
Chaînes de fonctions de service.
[bibtex-entry]
-
Nathann Cohen,
Nìcolas A Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Spy-Game on graphs: complexity and simple topologies.
Research Report,
Inria Sophia Antipolis,
2017.
[WWW
] [PDF
]
Keywords:
PSPACE-hard,
Cops and Robber games,
graphs.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a combinatorial game in graphs through Linear Programming.
Research Report,
Inria Sophia Antipolis,
2017.
[WWW
] [PDF
]
Keywords:
Linear Programming,
Cops and Robber games,
Graphs.
[bibtex-entry]
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin packing with colocations.
Research Report,
Inria ; I3S,
October 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Mathieu Hilaire,
Nicolas Martins,
Nicolas Nisse,
and Stéphane Pérennes.
Spy-Game on graphs.
Research Report RR-8869,
Inria,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?.
Research Report RR-8752,
INRIA Sophia Antipolis ; INRIA,
June 2015.
[WWW
] [PDF
]
Keywords:
graphs,
forwarding index,
routing,
design problem,
energy efficiency,
extremal graphs.
[Abstract] [bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
Grid spanners with low forwarding index for energy efficient networks.
Research Report RR-8643,
INRIA Sophia Antipolis ; INRIA,
December 2014.
[WWW
] [PDF
] [bibtex-entry]
-
Euripides Markou,
Nicolas Nisse,
and Stéphane Pérennes.
Exclusive Graph Searching vs. Pathwidth.
Research Report RR-8523,
INRIA,
2014.
[WWW
] [PDF
]
Keywords:
graph searching,
pathwidth,
computational complexity,
monotone strategies,
exclusivity property.
[bibtex-entry]
-
D. Agarwal,
J. Araujo,
C. Caillouet,
F. Cazals,
D. Coudert,
and S. Pérennes.
Connectivity Inference in Mass Spectrometry based Structure Determination.
Research Report RR-8320,
INRIA,
June 2013.
[WWW
] [PDF
] [bibtex-entry]
-
J. Araujo,
N. Nisse,
and S. Pérennes.
Weighted Coloring in Trees.
Research Report RR-8249,
INRIA,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
D. Coudert,
Luc Hogie,
A. Lancin,
D. Papadimitriou,
S. Pérennes,
and I. Tahiri.
Feasibility study on distributed simulations of BGP.
Research Report RR-8283,
INRIA,
April 2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Pardo Soares.
Connected Surveillance Game.
Research Report RR-8297,
INRIA,
May 2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
R. Modrzejewski,
N. Nisse,
and S. Pérennes.
Maintaining Balanced Trees For Structured Distributed Streaming Systems.
Research Report RR-8309,
INRIA,
May 2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
N. Nisse,
S. Pérennes,
and R. Pardo Soares.
Fractional Combinatorial Two-Player Games.
Research Report RR-8371,
INRIA,
September 2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
S. K. Gupta,
R. Modrzejewski,
J. Monteiro,
and S. Pérennes.
Analysis of the Repair Time in Distributed Storage Systems.
Research Report RR-7538,
INRIA,
02 2011.
[WWW
] [PDF
]
Keywords:
P2P storage systems,
data lifetime,
queuing model,
regenerating codes per- formance evaluation.
[Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
Research Report RR-7209,
INRIA,
February 2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
data life time,
mean time to data loss,
performance evaluation,
Markov chains.
[Abstract] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
and S. Pérennes.
Directed acyclic graphs with unique path property.
Technical report 6932,
INRIA,
May 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
H. Rivano,
I. Sau,
and F. Solano Donado.
MPLS label stacking on the line network.
Technical report RR-6803,
INRIA,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts.
Research Report RR-7071,
INRIA,
October 2009.
[WWW
] [PDF
]
Keywords:
GMPLS,
optical networks,
label stacking,
hypergraph layout,
approximation algorithms,
dynamic programming..
[Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
GMPLS Routing Strategies based on the Design of Hypergraph Layouts.
Technical report RR-6842,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?.
Research Report RR-7006,
INRIA,
July 2009.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance evaluation,
data durability.
[Abstract] [bibtex-entry]
-
F. Huc,
C. Molle,
N. Nisse,
S. Perennes,
and H. Rivano.
Stability of a local greedy distributed routing algorithm.
Technical report RR-6871,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Research Report RR-6690,
INRIA,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analysis of Failure Correlation in Peer-to-Peer Storage Systems.
Technical report RR-6761,
INRIA,
December 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
S. Pérennes,
and H. Rivano.
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks.
Technical report inria-00282200,
INRIA,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Pérennes and I. Sau.
Sur la Conjecture des Jeux Uniques.
Research Report RR-6691,
INRIA,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Research Report 6236,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
S. Perennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues.
Technical report inria-00175143,
HAL,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Technical Report RR-1437-07,
LaBRI,
October 2007.
[bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Research report,
INRIA Research Report HAL-00082015,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
and S. Pérennes.
On the pathwidth of planar graphs.
Research report,
INRIA Research Report HAL-00082035,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of gathering in static radio networks.
Research Report 5936,
INRIA,
06 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
P. Datta,
S. Pérennes,
H. Rivano,
and M-E. Voge.
Complexity and approximability issues of Shared Risk Resource Group.
Technical report,
INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR,
2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Delmas,
F. Havet,
M. Montassier,
and S. Pérennes.
Design of fault tolerant on-board networks.
Research report,
INRIA Research Report 5866,
March 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
G. Méheut,
S. Pérennes,
and H. Rivano.
Evaluation stochastique et simulation des réseaux radio.
Research report 5989,
INRIA,
September 2006.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
D. Coudert,
and S. Perennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
Technical report,
INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf),
2005.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
S. Choplin,
J. Galtier,
and S. Pérennes.
Optimal concave costs in the SDH context.
Research Report RR-5201,
INRIA,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
May 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
The Points and Vertices Game.
Research Report TRCS 030/2004,
Dipartimento di Informatica, Università degli Studi di L'Aquila,
2004.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
R. Klasing,
N. Morales,
and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands.
Research Report,
INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR,
2004.
Note: Submitted to Theoretical Computer Science.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
N. Baskiotis,
S. Pérennes,
and H. Rivano.
Heuristic design of multifiber WDM optical networks by randomized rounding of multicommodity flow.
Research Report RR-4418,
INRIA Research Report 4418,
2002.
[WWW
] [Abstract] [bibtex-entry]
-
B. Beauquier,
S. Pérennes,
and M. Syska.
Efficient Access to Optical Bandwidth, Routing and Grooming in WDM Networks: State-of-the-art survey.
IST CRESCCO report,
Projet MASCOTTE (CNRS/INRIA/UNSA),
Sophia Antipolis,
July 2002.
[bibtex-entry]
-
O. Audouin,
C. Blaizot,
E. Dotaro,
M. Vigoureux,
B. Beauquier,
J-C. Bermond,
B. Bongiovanni,
S. Pérennes,
M. Syska,
S. Bibas,
L. Chacon,
B. Decocq,
E. Didelet,
A. Laugier,
A. Lisser,
A. Ouorou,
and F. Tillerot.
Planification et Optimisation des Réseaux de Transport Optiques.
Rapport final RNRT PORTO,
Alcatel Research & Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France Télécom R&D,
Sophia Antipolis,
December 2001.
[bibtex-entry]
-
A. Ferreira,
S. Pérennes,
A. Richa,
H. Rivano,
and N. Stier.
On the design of multifiber WDM networks.
Research Report,
INRIA Research Report 4244,
August 2001.
[WWW
] [Abstract] [bibtex-entry]
-
A. Ferreira,
S. Pérennes,
and H. Rivano.
Fractional coloring of bounded degree trees.
Research Report,
INRIA Research Report 4094,
January 2001.
[WWW
] [Abstract] [bibtex-entry]
-
B. Beauquier,
O. Delmas,
and S. Pérennes.
Tight bounds for broadcasting in the linear cost model.
Rapport de Recherche 3827,
INRIA,
novembre 2000.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Digraph Isomorphisms and Free Space Optical Networks.
Technical report,
INRIA Research Report 3817,
1999.
[POSTSCRIPT
] [bibtex-entry]
-
M. Flammini and S. Pérennes.
Tight Upper bound for broadcasting and gossiping.
Technical report,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower Bounds on systolic gossip..
Technical report 3612,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
-
F. Fraigniaud,
A. Pelc,
and S. Pérennes.
Fast tree naming.
Technical report 3609,
INRIA,
1999.
[bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Optimal broadcasting in unknown networks.
Technical report 3609,
INRIA,
1999.
[bibtex-entry]
-
Andrea Tomassilli,
Giuseppe Di Lena,
Frédéric Giroire,
Issam Tahiri,
Stéphane Pérennes,
Damien Saucez,
Thierry Turletti,
Ruslan Sadykov,
François Vanderbeck,
and Chidung Lac.
Poster: Design of Survivable SDN/NFV-enabled Networks with Bandwidth-optimal Failure Recovery.
NETWORKING 2019 - IFIP Networking conference,
May 2019.
Note: Poster.
[WWW
] [PDF
] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:46 2022
