Stéphane Pérennes

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 23

Top Topics

Clustering Coefficient

Degree Distribution

Failure Recovery

Top Venues

Theor. Comput. Sci.

Publications

Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet
A random growth model with any real or theoretical degree distribution. Theor. Comput. Sci. 940 (Part) (2023)
Hicham Lesfari, Frédéric Giroire, Stéphane Pérennes
Biased Majority Opinion Dynamics: Exploiting Graph k-domination. IJCAI (2022)
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest clustering coefficient: a new metric for directed networks like Twitter. J. Complex Networks 10 (1) (2021)
Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica 83 (5) (2021)
Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac
Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Comput. Networks 192 (2021)
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Sequential Metric Dimension. Algorithmica 82 (10) (2020)
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82 (2) (2020)
Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet
A Random Growth Model with Any Real or Theoretical Degree Distribution. COMPLEX NETWORKS (2) (2020)
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter. COMPLEX NETWORKS (2) (2020)
Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet
A Random Growth Model with any Real or Theoretical Degree Distribution. CoRR (2020)
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. CoRR (2020)
Andrea Tomassilli, Chidung Lac, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. Networking (2019)
Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Eternal Domination in Grids. CIAC (2019)
Frédéric Giroire, Nicolas Huin, Andrea Tomassilli, Stéphane Pérennes
When Network Matters: Data Center Scheduling with Network Tasks. INFOCOM (2019)
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Sequential Metric Dimension. WAOA (2018)
Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725 (2018)
Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, Stéphane Pérennes
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. INFOCOM (2018)
Euripides Markou, Nicolas Nisse, Stéphane Pérennes
Exclusive graph searching vs. pathwidth. Inf. Comput. 252 (2017)
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC (2017)
Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes
Maintaining balanced trees for structured distributed streaming systems. Discret. Appl. Math. 232 (2017)
Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes
Spy-Game on Graphs. FUN (2016)
David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge
Combinatorial optimization in networks with Shared Risk Link Groups. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos
Bin Packing with Colocations. WAOA (2016)
Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes
Design of fault-tolerant on-board networks with variable switch sizes. Theor. Comput. Sci. 562 (2015)
Frédéric Giroire, Stéphane Pérennes, Issam Tahiri
On the complexity of equal shortest path routing. Networks 65 (4) (2015)
Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares
Connected surveillance game. Theor. Comput. Sci. 584 (2015)
Frédéric Giroire, Stéphane Pérennes, Issam Tahiri
How to Design Graphs with Low Forwarding Index and Limited Number of Edges. IWOCA (2015)
Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes
P2P storage systems: Study of different placement policies. Peer-to-Peer Netw. Appl. 7 (4) (2014)
Júlio Araújo, Nicolas Nisse, Stéphane Pérennes
Weighted Coloring in Trees. STACS (2014)
Júlio Araújo, Nicolas Nisse, Stéphane Pérennes
Weighted Coloring in Trees. SIAM J. Discret. Math. 28 (4) (2014)
Deepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes
Connectivity Inference in Mass Spectrometry Based Structure Determination. ESA (2013)
Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes
Gathering Radio Messages in the Path. Discret. Math. Algorithms Appl. 5 (1) (2013)
Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes
Maintaining Balanced Trees for Structured Distributed Streaming Systems. SIROCCO (2013)
Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes
Directed acyclic graphs with the unique dipath property. Theor. Comput. Sci. 504 (2013)
David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri
Feasibility study on distributed simulations of BGP CoRR (2013)
Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro
Optimal time data gathering in wireless networks with multidirectional antennas. Theor. Comput. Sci. 509 (2013)
Frédéric Giroire, Stéphane Pérennes, Issam Tahiri
On the Hardness of Equal Shortest Path Routing. Electron. Notes Discret. Math. 41 (2013)
Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares
Connected Surveillance Game. SIROCCO (2013)
Frédéric Giroire, Sandeep Kumar Gupta, Remigiusz Modrzejewski, Julian Monteiro, Stéphane Pérennes
Repair Time in Distributed Storage Systems. Globe (2013)
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444 (2012)
David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri
Feasibility study on distributed simulations of BGP CoRR (2012)
David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri
Feasibility Study on Distributed Simulations of BGP. PADS (2012)
Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160 (12) (2012)
Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO (2011)
Christelle Caillouet, Stéphane Pérennes, Hervé Rivano
Framework for optimizing the capacity of wireless mesh networks. Comput. Commun. 34 (13) (2011)
Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc
Minimal selectors and fault tolerant networks. Networks 55 (4) (2010)
Christelle Caillouet, Stéphane Pérennes, Hervé Rivano
Cross line and column generation for the cut covering problem in wireless networks. Electron. Notes Discret. Math. 36 (2010)
Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes
Data Life Time for Different Placement Policies in P2P Storage Systems. Globe (2010)
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano
Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58 (2) (2010)
Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano
Stability of a localized and greedy routing algorithm. IPDPS Workshops (2010)
Frédéric Giroire, Julian Monteiro, Stéphane Pérennes
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy. GLOBECOM (2010)
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado
MPLS Label Stacking on the Line Network. Networking (2009)
Omid Amini, Stéphane Pérennes, Ignasi Sau
Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410 (38-40) (2009)
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO (2009)
Omid Amini, Florian Huc, Stéphane Pérennes
On the Path-Width of Planar Graphs. SIAM J. Discret. Math. 23 (3) (2009)
Aubin Jarry, Stéphane Pérennes
Disjoint paths in symmetric digraphs. Discret. Appl. Math. 157 (1) (2009)
Frédéric Giroire, Julian Monteiro, Stéphane Pérennes
P2P storage systems: How much locality can they tolerate? LCN (2009)
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes
From Balls and Bins to Points and Vertices. Algorithmic Oper. Res. 4 (2) (2009)
Christelle Molle, Fabrice Peix, Stéphane Pérennes, Hervé Rivano
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations. TGC (2008)
Ralf Klasing, Nelson Morales, Stéphane Pérennes
On the complexity of bandwidth allocation in radio networks. Theor. Comput. Sci. 406 (3) (2008)
Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA (2008)
Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
Asymptotically Optimal Solutions for Small World Graphs. Theory Comput. Syst. 42 (4) (2008)
Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters
Neighborhood Broadcasting in Hypercubes. SIAM J. Discret. Math. 21 (4) (2007)
Omid Amini, Stéphane Pérennes, Ignasi Sau
Hardness and Approximation of Traffic Grooming. ISAAC (2007)
Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. SIROCCO (2007)
Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW (2006)
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes, Paul M. B. Vitányi
About the Lifespan of Peer to Peer Networks CoRR (2006)
Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
Hardness and approximation of Gathering in static radio networks. PerCom Workshops (2006)
Michele Flammini, Stéphane Pérennes
Lower bounds on systolic gossip. Inf. Comput. 196 (2) (2005)
Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
Asymptotically Optimal Solutions for Small World Graphs. DISC (2005)
Michele Flammini, Alfredo Navarra, Stéphane Pérennes
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. WEA (2005)
Sébastien Choplin, Aubin Jarry, Stéphane Pérennes
Virtual network embedding in the cycle. Discret. Appl. Math. 145 (3) (2005)
Michele Flammini, Stéphane Pérennes
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM J. Discret. Math. 17 (4) (2004)
Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes
Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC (2004)
Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
Distance labeling in graphs. J. Algorithms 53 (1) (2004)
Gurvan Huiban, Stéphane Pérennes, Michel Syska
Traffic grooming in WDM networks with multi-layer switches. ICC (2002)
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
Complete Rotations in Cayley Graphs. Eur. J. Comb. 22 (2) (2001)
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
Rotational Cayley Graphs on Transposition Generated Groups. Electron. Notes Discret. Math. 5 (2000)
Christophe Calvin, Stéphane Pérennes, Denis Trystram
All-to-all broadcast in torus with wormhole-like routing. SPDP (1995)