Sorting-Based Selection Algorithms for Hypercube Networks. - Pascal Berthomé; Afonso Ferreira; Bruce M. Maggs; Stephane Perennes; C. Greg Plaxton (IPPS, 1993)

Gossiping in Cayley Graphs by Packets. - Jean-Claude Bermond; Takako Kodate; Stephane Perennes (Combinatorics and Computer Science, 1995)

Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. - Jean-Claude Bermond; Stephane Perennes (SIROCCO, 1995)

All-to-all broadcast in torus with wormhole-like routing. - Christophe Calvin; Stéphane Pérennes; Denis Trystram (SPDP, 1995)

Circuit-Switched Gossiping in 3-Dimensional Torus Networks. - Olivier Delmas; Stephane Perennes (Euro-Par, Vol. I, 1996)

A Gossip Algorithm for Bus Networks with Buses of Limited Length. - Satoshi Fujita; Christian Laforest; Stephane Perennes (Euro-Par, Vol. I, 1996)

Lower Bounds on Broadcasting Time of de Bruijn Networks. - Stephane Perennes (Euro-Par, Vol. I, 1996)

Memory Requirements for Routing in Distributed Networks (Extended Abstract). - Cyril Gavoille; Stephane Perennes (PODC, 1996)

Tight Bounds on the Size of 2-Monopolies. - Jean-Claude Bermond; Johny Bond; David Peleg; Stephane Perennes (SIROCCO, 1996)

Lower Bounds for Shortest Path Interval Routing. - Cyril Gavoille; Stephane Perennes (SIROCCO, 1996)

Optimal Information Dissemination in Star and Pancake Networks. - Pascal Berthomé; Afonso Ferreira; Stephane Perennes (IEEE Trans. Parallel Distributed Syst., 1996)

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. - Luisa Gargano; Pavol Hell; Stephane Perennes (ICALP, 1997)

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (WG, 1997)

A Proof of Jean De Rumeur's Conjecture. - Stephane Perennes (Discret. Appl. Math., 1997)

A Note on the Dimensionality of Modified Knö;del Graphs. - Jean-Claude Bermond; Hovhannes A. Harutyunyan; Arthur L. Liestman; Stephane Perennes (Int. J. Found. Comput. Sci., 1997)

Optimal Wavelength-routed Multicasting. - Bruno Beauquier; Pavol Hell; Stephane Perennes (Discret. Appl. Math., 1998)

Hamilton Circuits in the Directed Wrapped Butterfly Network. - Jean-Claude Bermond; Olivier Delmas; Éric Darrot; Stephane Perennes (Discret. Appl. Math., 1998)

Optimal Sequential Gossiping by Short Messages. - Jean-Claude Bermond; Luisa Gargano; Stephane Perennes (Discret. Appl. Math., 1998)

Large Generalized Cycles. - José Gómez; Carles Padró; Stephane Perennes (Discret. Appl. Math., 1998)

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. - Stephane Perennes (Discret. Appl. Math., 1998)

Hamilton Cycle Decomposition of the Butterfly Network. - Jean-Claude Bermond; Éric Darrot; Olivier Delmas; Stephane Perennes (Parallel Process. Lett., 1998)

Neighbourhood Gossiping in Hypercubes. - Satoshi Fujita; Stephane Perennes; Joseph G. Peters (Parallel Process. Lett., 1998)

All-to-All Routing and Coloring in Weighted Trees of Rings. - Bruno Beauquier; Stephane Perennes; David Tóth (SPAA, 1999)

Broadcasting in Hypercubes in the Circuit Switched Model. - Jean-Claude Bermond; Takako Kodate; Stephane Perennes; Alexis Bonnecaze; Patrick Solé (IPDPS, 2000)

De Bruijn Isomorphisms and Free Space Optical Networks. - David Coudert; Afonso Ferreira; Stephane Perennes (IPDPS, 2000)

On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. - Arunabha Sen; K. Selçuk Candan; Afonso Ferreira; Bruno Beauquier; Stephane Perennes (NETWORKING, 2000)

Assigning labels in unknown anonymous networks (extended abstract). - Pierre Fraigniaud; Andrzej Pelc; David Peleg; Stephane Perennes (PODC, 2000)

Sorting-Based Selection Algorithms for Hypercubic Networks. - Pascal Berthomé; Afonso Ferreira; Bruce M. Maggs; Stephane Perennes; C. Greg Plaxton (Algorithmica, 2000)

Rotational Cayley Graphs on Transposition Generated Groups. - Marie-Claude Heydemann; Nausica Marlin; Stéphane Pérennes (Electron. Notes Discret. Math., 2000)

Efficient collective communication in optical networks. - Jean-Claude Bermond; Luisa Gargano; Stephane Perennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2000)

Fractional Path Coloring with Applications to WDM Networks. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Hervé Rivano (ICALP, 2001)

Assigning labels in an unknown anonymous network with a leader. - Pierre Fraigniaud; Andrzej Pelc; David Peleg; Stephane Perennes (Distributed Comput., 2001)

Complete Rotations in Cayley Graphs. - Marie-Claude Heydemann; Nausica Marlin; Stéphane Pérennes (Eur. J. Comb., 2001)

Coloring all directed paths in a symmetric tree, with an application to optical networks. - Luisa Gargano; Pavol Hell; Stephane Perennes (J. Graph Theory, 2001)

Tight Bounds for Broadcasting in the Linear Cost Model. - Bruno Beauquier; Stephane Perennes; Olivier Delmas (J. Interconnect. Networks, 2001)

Efficient communication in unknown networks. - Luisa Gargano; Andrzej Pelc; Stephane Perennes; Ugo Vaccaro (Networks, 2001)

On the Optimality of General Lower Bounds for Broadcasting and Gossiping. - Michele Flammini; Stephane Perennes (SIAM J. Discret. Math., 2001)

Traffic grooming in WDM networks with multi-layer switches. - Gurvan Huiban; Stéphane Pérennes; Michel Syska (ICC, 2002)

Isomorphisms of the De Bruijn digraph and free-space optical networks. - David Coudert; Afonso Ferreira; Stephane Perennes (Networks, 2002)

The Minimum Range Assignment Problem on Linear Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Afonso Ferreira; Stephane Perennes; Riccardo Silvestri (Algorithmica, 2003)

The Power of Small Coalitions in Graphs. - Jean-Claude Bermond; Johny Bond; David Peleg; Stephane Perennes (Discret. Appl. Math., 2003)

Deadlock Prevention by Acyclic Orientations. - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (Discret. Appl. Math., 2003)

Simultaneous Edge Flipping in Triangulations. - Jérôme Galtier; Ferran Hurtado; Marc Noy; Stephane Perennes; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2003)

Hierarchical Ring Network design. - Jean-Claude Bermond; Sébastien Choplin; Stephane Perennes (Theory Comput. Syst., 2003)

Directed virtual path layouts in ATM networks. - Jean-Claude Bermond; Nausica Marlin; David Peleg; Stephane Perennes (Theor. Comput. Sci., 2003)

Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. - Afonso Ferreira; Stephane Perennes; Hervé Rivano; Andréa W. Richa; Nicolás E. Stier Moses (Telecommun. Syst., 2003)

Range-Free Ranking in Sensors Networks and Its Applications to Localization. - Zvi Lotker; Marc Martinez de Albeniz; Stephane Perennes (ADHOC-NOW, 2004)

Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. - Ralf Klasing; Alfredo Navarra; Aris A. Papadopoulos; Stephane Perennes (NETWORKING, 2004)

Approximate constrained bipartite edge coloring. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Pino Persiano; Hervé Rivano (Discret. Appl. Math., 2004)

Distance labeling in graphs. - Cyril Gavoille; David Peleg; Stéphane Pérennes; Ran Raz (J. Algorithms, 2004)

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. - Michele Flammini; Stéphane Pérennes (SIAM J. Discret. Math., 2004)

Virtual network embedding in the cycle. - Sébastien Choplin; Aubin Jarry; Stéphane Pérennes (Discret. Appl. Math., 2005)

Lower bounds on systolic gossip. - Michele Flammini; Stéphane Pérennes (Inf. Comput., 2005)

Optimal Solution of the Maximum All Request Path Grooming Problem. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Stéphane Pérennes (AICT/ICIW, 2006)

About the Lifespan of Peer to Peer Networks, . - Rudi Cilibrasi; Zvi Lotker; Alfredo Navarra; Stephane Perennes; Paul M. B. Vitányi (OPODIS, 2006)

The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. - Michele Flammini; Alfredo Navarra; Stephane Perennes (ACM J. Exp. Algorithmics, 2006)

Hardness and Approximation of Gathering in Static Radio Networks. - Jean-Claude Bermond; Jérôme Galtier; Ralf Klasing; Nelson Morales; Stephane Perennes (Parallel Process. Lett., 2006)

Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. - Jean-Claude Bermond; Frédéric Giroire; Stéphane Pérennes (SIROCCO, 2007)

Improved Approximation Results for the Minimum Energy Broadcasting Problem. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Algorithmica, 2007)

Shared Risk Resource Group Complexity and Approximability Issues. - David Coudert; Pallab Datta; Stephane Perennes; Hervé Rivano; Marie-Emilie Voge (Parallel Process. Lett., 2007)

Neighborhood Broadcasting in Hypercubes. - Jean-Claude Bermond; Afonso Ferreira; Stéphane Pérennes; Joseph G. Peters (SIAM J. Discret. Math., 2007)

Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations. - Christelle Molle; Fabrice Peix; Stéphane Pérennes; Hervé Rivano (TGC, 2008)

Degree-Constrained Subgraph Problems: Hardness and Approximation Results. - Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 001 (WAOA, 2008)

Asymptotically Optimal Solutions for Small World Graphs. - Michele Flammini; Luca Moscardelli; Alfredo Navarra; Stéphane Pérennes (Theory Comput. Syst., 2008)

On the complexity of bandwidth allocation in radio networks. - Ralf Klasing; Nelson Morales; Stéphane Pérennes (Theor. Comput. Sci., 2008)

Tightening the upper bound for the minimum energy broadcasting. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Wirel. Networks, 2008)

P2P storage systems: How much locality can they tolerate? - Frédéric Giroire; Julian Monteiro; Stéphane Pérennes (LCN, 2009)

MPLS Label Stacking on the Line Network. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Hervé Rivano; Ignasi Sau; Fernando Solano Donado (Networking, 2009)

Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. - Olivier Dalle; Frédéric Giroire; Julian Monteiro; Stephane Perennes (Peer-to-Peer Computing, 2009)

Designing Hypergraph Layouts to GMPLS Routing Strategies. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (SIROCCO, 2009)

From Balls and Bins to Points and Vertices. - Ralf Klasing; Zvi Lotker; Alfredo Navarra; Stéphane Pérennes (Algorithmic Oper. Res., 2009)

Disjoint paths in symmetric digraphs. - Aubin Jarry; Stéphane Pérennes (Discret. Appl. Math., 2009)

On the Path-Width of Planar Graphs. - Omid Amini; Florian Huc; Stéphane Pérennes (SIAM J. Discret. Math., 2009)

Hardness and approximation of traffic grooming. - Omid Amini; Stéphane Pérennes; Ignasi Sau (Theor. Comput. Sci., 2009)

Data Life Time for Different Placement Policies in P2P Storage Systems. - Stéphane Caron; Frédéric Giroire; Dorian Mazauric; Julian Monteiro; Stéphane Pérennes (Globe, 2010)

Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy. - Frédéric Giroire; Julian Monteiro; Stéphane Pérennes (GLOBECOM, 2010)

Stability of a localized and greedy routing algorithm. - Christelle Caillouet; Florian Huc; Nicolas Nisse; Stéphane Pérennes; Hervé Rivano (IPDPS Workshops, 2010)

Fractional Path Coloring in Bounded Degree Trees with Applications. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stéphane Pérennes; Hervé Rivano (Algorithmica, 2010)

Cross line and column generation for the cut covering problem in wireless networks. - Christelle Caillouet; Stéphane Pérennes; Hervé Rivano (Electron. Notes Discret. Math., 2010)

Minimal selectors and fault tolerant networks. - Omid Amini; Frédéric Giroire; Stéphane Pérennes; Florian Huc (Networks, 2010)

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (SIROCCO, 2011)

Framework for optimizing the capacity of wireless mesh networks. - Christelle Caillouet; Stéphane Pérennes; Hervé Rivano (Comput. Commun., 2011)

Feasibility Study on Distributed Simulations of BGP. - David Coudert; Luc Hogie; Aurélien Lancin; Dimitri Papadimitriou; Stéphane Pérennes; Issam Tahiri (PADS, 2012)

On the approximability of some degree-constrained subgraph problems. - Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 001 (Discret. Appl. Math., 2012)

GMPLS label space minimization through hypergraph layouts. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (Theor. Comput. Sci., 2012)

Connectivity Inference in Mass Spectrometry Based Structure Determination. - Deepesh Agarwal; Júlio César Silva Araújo; Christelle Caillouet; Frédéric Cazals; David Coudert; Stéphane Pérennes (ESA, 2013)

Repair Time in Distributed Storage Systems. - Frédéric Giroire; Sandeep Kumar Gupta; Remigiusz Modrzejewski; Julian Monteiro; Stéphane Pérennes (Globe, 2013)

Connected Surveillance Game. - Frédéric Giroire; Dorian Mazauric; Nicolas Nisse; Stéphane Pérennes; Ronan Pardo Soares (SIROCCO, 2013)

Gathering Radio Messages in the Path. - Jean-Claude Bermond; Ralf Klasing; Nelson Morales; Stéphane Pérennes; Patricio Reyes (Discret. Math. Algorithms Appl., 2013)

On the Hardness of Equal Shortest Path Routing. - Frédéric Giroire; Stéphane Pérennes; Issam Tahiri (Electron. Notes Discret. Math., 2013)

Directed acyclic graphs with the unique dipath property. - Jean-Claude Bermond; Michel Cosnard; Stéphane Pérennes (Theor. Comput. Sci., 2013)

Optimal time data gathering in wireless networks with multidirectional antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2013)

P2P storage systems: Study of different placement policies. - Stéphane Caron; Frédéric Giroire; Dorian Mazauric; Julian Monteiro; Stéphane Pérennes (Peer-to-Peer Netw. Appl., 2014)

Weighted Coloring in Trees. - Júlio Araújo 001; Nicolas Nisse; Stéphane Pérennes (SIAM J. Discret. Math., 2014)

How to Design Graphs with Low Forwarding Index and Limited Number of Edges. - Frédéric Giroire; Stéphane Pérennes; Issam Tahiri (IWOCA, 2015)

On the complexity of equal shortest path routing. - Frédéric Giroire; Stéphane Pérennes; Issam Tahiri (Networks, 2015)

Design of fault-tolerant on-board networks with variable switch sizes. - Olivier Delmas; Frédéric Havet; Mickaël Montassier; Stéphane Pérennes (Theor. Comput. Sci., 2015)

Connected surveillance game. - Frédéric Giroire; Ioannis Lamprou 001; Dorian Mazauric; Nicolas Nisse; Stéphane Pérennes; R. Soares 001 (Theor. Comput. Sci., 2015)

Spy-Game on Graphs. - Nathann Cohen; Mathieu Hilaire; Nicolas Almeida Martins; Nicolas Nisse; Stéphane Pérennes (FUN, 2016)

Bin Packing with Colocations. - Jean-Claude Bermond; Nathann Cohen; David Coudert; Dimitrios Letsios; Ioannis Milis; Stéphane Pérennes; Vassilis Zissimopoulos (WAOA, 2016)

Combinatorial optimization in networks with Shared Risk Link Groups. - David Coudert; Stéphane Pérennes; Hervé Rivano; Marie-Emilie Voge (Discret. Math. Theor. Comput. Sci., 2016)

Maintaining balanced trees for structured distributed streaming systems. - Frédéric Giroire; Remigiusz Modrzejewski; Nicolas Nisse; Stéphane Pérennes (Discret. Appl. Math., 2017)

Exclusive graph searching vs. pathwidth. - Euripides Markou; Nicolas Nisse; Stéphane Pérennes (Inf. Comput., 2017)

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. - Andrea Tomassilli; Frédéric Giroire; Nicolas Huin; Stéphane Pérennes (INFOCOM, 2018)

Grid spanners with low forwarding index for energy efficient networks. - Frédéric Giroire; Stephane Perennes; Issam Tahiri (Discret. Appl. Math., 2018)

Spy-game on graphs: Complexity and simple topologies. - Nathann Cohen; Nicolas Almeida Martins; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes; Rudini M. Sampaio (Theor. Comput. Sci., 2018)

Eternal Domination in Grids. - Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (CIAC, 2019)

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. - Andrea Tomassilli; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stephane Perennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck; Chidung Lac (CloudNet, 2019)

When Network Matters: Data Center Scheduling with Network Tasks. - Frédéric Giroire; Nicolas Huin; Andrea Tomassilli; Stéphane Pérennes (INFOCOM, 2019)

Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. - 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 (Networking, 2019)

Sequential Metric Dimension. - Julien Bensmail; Dorian Mazauric; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

Study of a Combinatorial Game in Graphs Through Linear Programming. - Nathann Cohen; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. - Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2021)

Design of robust programmable networks with bandwidth-optimal failure recovery scheme. - 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 (Comput. Networks, 2021)

Interest clustering coefficient: a new metric for directed networks like Twitter. - Thibaud Trolliet; Nathann Cohen; Frédéric Giroire; Luc Hogie; Stéphane Pérennes (J. Complex Networks, 2021)

Biased Majority Opinion Dynamics: Exploiting Graph k-domination. - Hicham Lesfari; Frédéric Giroire; Stéphane Pérennes (IJCAI, 2022)

A random growth model with any real or theoretical degree distribution. - Frédéric Giroire; Stéphane Pérennes; Thibaud Trolliet (Theor. Comput. Sci., 2023)

Scheduling with Fully Compressible Tasks: Application to Deep Learning Inference with Neural Network Compression. - Tiago Da Silva Barros; Frédéric Giroire; Ramon Aparicio-Pardo; Stéphane Pérennes; Emanuele Natale (CCGrid, 2024)

Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget. - Tiago Da Silva Barros; Davide Ferré; Frédéric Giroire; Ramon Aparicio-Pardo; Stephane Perennes (ICPP, 2024)