Stéphane Pérennes

Orcid: 0009-0006-1900-9824

Affiliations:
  • INRIA, France


According to our database1, Stéphane Pérennes authored at least 119 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget.
Proceedings of the 53rd International Conference on Parallel Processing, 2024

Scheduling with Fully Compressible Tasks: Application to Deep Learning Inference with Neural Network Compression.
Proceedings of the 24th IEEE International Symposium on Cluster, 2024

2023
A random growth model with any real or theoretical degree distribution.
Theor. Comput. Sci., 2023

2022
Biased Majority Opinion Dynamics: Exploiting Graph k-domination.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Interest clustering coefficient: a new metric for directed networks like Twitter.
J. Complex Networks, 2021

Design of robust programmable networks with bandwidth-optimal failure recovery scheme.
Comput. Networks, 2021

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
Algorithmica, 2021

2020
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica, 2020

Sequential Metric Dimension.
Algorithmica, 2020

2019
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery.
Proceedings of the 2019 IFIP Networking Conference, 2019

When Network Matters: Data Center Scheduling with Network Tasks.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019

Eternal Domination in Grids.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci., 2018

Grid spanners with low forwarding index for energy efficient networks.
Discret. Appl. Math., 2018

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
Exclusive graph searching vs. pathwidth.
Inf. Comput., 2017

Maintaining balanced trees for structured distributed streaming systems.
Discret. Appl. Math., 2017

2016
Combinatorial optimization in networks with Shared Risk Link Groups.
Discret. Math. Theor. Comput. Sci., 2016

Bin Packing with Colocations.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Spy-Game on Graphs.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Connected surveillance game.
Theor. Comput. Sci., 2015

Design of fault-tolerant on-board networks with variable switch sizes.
Theor. Comput. Sci., 2015

On the complexity of equal shortest path routing.
Networks, 2015

How to Design Graphs with Low Forwarding Index and Limited Number of Edges.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Weighted Coloring in Trees.
SIAM J. Discret. Math., 2014

P2P storage systems: Study of different placement policies.
Peer-to-Peer Netw. Appl., 2014

2013
Optimal time data gathering in wireless networks with multidirectional antennas.
Theor. Comput. Sci., 2013

Directed acyclic graphs with the unique dipath property.
Theor. Comput. Sci., 2013

On the Hardness of Equal Shortest Path Routing.
Electron. Notes Discret. Math., 2013

Gathering Radio Messages in the Path.
Discret. Math. Algorithms Appl., 2013

Connected Surveillance Game.
Proceedings of the Structural Information and Communication Complexity, 2013

Repair Time in Distributed Storage Systems.
Proceedings of the Data Management in Cloud, Grid and P2P Systems, 2013

Connectivity Inference in Mass Spectrometry Based Structure Determination.
Proceedings of the Algorithms - ESA 2013, 2013

2012
GMPLS label space minimization through hypergraph layouts.
Theor. Comput. Sci., 2012

On the approximability of some degree-constrained subgraph problems.
Discret. Appl. Math., 2012

Feasibility Study on Distributed Simulations of BGP.
Proceedings of the 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, 2012

2011
Framework for optimizing the capacity of wireless mesh networks.
Comput. Commun., 2011

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
Minimal selectors and fault tolerant networks.
Networks, 2010

Cross line and column generation for the cut covering problem in wireless networks.
Electron. Notes Discret. Math., 2010

Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica, 2010

Stability of a localized and greedy routing algorithm.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy.
Proceedings of the Global Communications Conference, 2010

Data Life Time for Different Placement Policies in P2P Storage Systems.
Proceedings of the Data Management in Grid and Peer-to-Peer Systmes, 2010

2009
Hardness and approximation of traffic grooming.
Theor. Comput. Sci., 2009

On the Path-Width of Planar Graphs.
SIAM J. Discret. Math., 2009

Disjoint paths in symmetric digraphs.
Discret. Appl. Math., 2009

From Balls and Bins to Points and Vertices.
Algorithmic Oper. Res., 2009

Designing Hypergraph Layouts to GMPLS Routing Strategies.
Proceedings of the Structural Information and Communication Complexity, 2009

Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems.
Proceedings of the Proceedings P2P 2009, 2009

MPLS Label Stacking on the Line Network.
Proceedings of the NETWORKING 2009, 2009

P2P storage systems: How much locality can they tolerate?
Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

2008
Tightening the upper bound for the minimum energy broadcasting.
Wirel. Networks, 2008

On the complexity of bandwidth allocation in radio networks.
Theor. Comput. Sci., 2008

Asymptotically Optimal Solutions for Small World Graphs.
Theory Comput. Syst., 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations.
Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

2007
Neighborhood Broadcasting in Hypercubes.
SIAM J. Discret. Math., 2007

Shared Risk Resource Group Complexity and Approximability Issues.
Parallel Process. Lett., 2007

Improved Approximation Results for the Minimum Energy Broadcasting Problem.
Algorithmica, 2007

Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions.
Proceedings of the Structural Information and Communication Complexity, 2007

2006
Hardness and Approximation of Gathering in Static Radio Networks.
Parallel Process. Lett., 2006

The "real" approximation factor of the MST heuristic for the minimum energy broadcasting.
ACM J. Exp. Algorithmics, 2006

About the Lifespan of Peer to Peer Networks, .
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Optimal Solution of the Maximum All Request Path Grooming Problem.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005
Lower bounds on systolic gossip.
Inf. Comput., 2005

Virtual network embedding in the cycle.
Discret. Appl. Math., 2005

2004
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols.
SIAM J. Discret. Math., 2004

Distance labeling in graphs.
J. Algorithms, 2004

Approximate constrained bipartite edge coloring.
Discret. Appl. Math., 2004

Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem.
Proceedings of the NETWORKING 2004, 2004

Range-Free Ranking in Sensors Networks and Its Applications to Localization.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.
Telecommun. Syst., 2003

Directed virtual path layouts in ATM networks.
Theor. Comput. Sci., 2003

Hierarchical Ring Network design.
Theory Comput. Syst., 2003

Simultaneous Edge Flipping in Triangulations.
Int. J. Comput. Geom. Appl., 2003

Deadlock Prevention by Acyclic Orientations.
Discret. Appl. Math., 2003

The Power of Small Coalitions in Graphs.
Discret. Appl. Math., 2003

The Minimum Range Assignment Problem on Linear Radio Networks.
Algorithmica, 2003

2002
Isomorphisms of the De Bruijn digraph and free-space optical networks.
Networks, 2002

Traffic grooming in WDM networks with multi-layer switches.
Proceedings of the IEEE International Conference on Communications, 2002

2001
On the Optimality of General Lower Bounds for Broadcasting and Gossiping.
SIAM J. Discret. Math., 2001

Efficient communication in unknown networks.
Networks, 2001

Tight Bounds for Broadcasting in the Linear Cost Model.
J. Interconnect. Networks, 2001

Coloring all directed paths in a symmetric tree, with an application to optical networks.
J. Graph Theory, 2001

Complete Rotations in Cayley Graphs.
Eur. J. Comb., 2001

Assigning labels in an unknown anonymous network with a leader.
Distributed Comput., 2001

Fractional Path Coloring with Applications to WDM Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Efficient collective communication in optical networks.
Theor. Comput. Sci., 2000

Rotational Cayley Graphs on Transposition Generated Groups.
Electron. Notes Discret. Math., 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.
Algorithmica, 2000

Assigning labels in unknown anonymous networks (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths.
Proceedings of the NETWORKING 2000, 2000

De Bruijn Isomorphisms and Free Space Optical Networks.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Broadcasting in Hypercubes in the Circuit Switched Model.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
All-to-All Routing and Coloring in Weighted Trees of Rings.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998
Neighbourhood Gossiping in Hypercubes.
Parallel Process. Lett., 1998

Hamilton Cycle Decomposition of the Butterfly Network.
Parallel Process. Lett., 1998

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

Large Generalized Cycles.
Discret. Appl. Math., 1998

Optimal Sequential Gossiping by Short Messages.
Discret. Appl. Math., 1998

Hamilton Circuits in the Directed Wrapped Butterfly Network.
Discret. Appl. Math., 1998

Optimal Wavelength-routed Multicasting.
Discret. Appl. Math., 1998

1997
A Note on the Dimensionality of Modified Knö;del Graphs.
Int. J. Found. Comput. Sci., 1997

A Proof of Jean De Rumeur's Conjecture.
Discret. Appl. Math., 1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Optimal Information Dissemination in Star and Pancake Networks.
IEEE Trans. Parallel Distributed Syst., 1996

Lower Bounds for Shortest Path Interval Routing.
Proceedings of the SIROCCO'96, 1996

Tight Bounds on the Size of 2-Monopolies.
Proceedings of the SIROCCO'96, 1996

Memory Requirements for Routing in Distributed Networks (Extended Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Lower Bounds on Broadcasting Time of de Bruijn Networks.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

A Gossip Algorithm for Bus Networks with Buses of Limited Length.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Circuit-Switched Gossiping in 3-Dimensional Torus Networks.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
All-to-all broadcast in torus with wormhole-like routing.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.
Proceedings of the Structure, Information and Communication Complexity, 1995

Gossiping in Cayley Graphs by Packets.
Proceedings of the Combinatorics and Computer Science, 1995

1993
Sorting-Based Selection Algorithms for Hypercube Networks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993


  Loading...