Stéphane Pérennes

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Grid spanners with low forwarding index for energy efficient networks.
Discrete Applied Mathematics, 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.
Discrete Applied Mathematics, 2017

Study of a Combinatorial Game in Graphs Through Linear Programming.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Grid spanners with low forwarding index for energy efficient networks.
Electronic Notes in Discrete Mathematics, 2016

Combinatorial optimization in networks with Shared Risk Link Groups.
Discrete Mathematics & Theoretical Computer Science, 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. Discrete Math., 2014

P2P storage systems: Study of different placement policies.
Peer-to-Peer Networking and Applications, 2014

Weighted Coloring in Trees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 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.
Electronic Notes in Discrete Mathematics, 2013

Gathering Radio Messages in the Path.
Discrete Math., Alg. and Appl., 2013

Feasibility study on distributed simulations of BGP
CoRR, 2013

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

Maintaining Balanced Trees for Structured Distributed Streaming Systems.
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.
Discrete Applied Mathematics, 2012

Feasibility study on distributed simulations of BGP
CoRR, 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.
Computer Communications, 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.
Electronic Notes in Discrete Mathematics, 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. Discrete Math., 2009

Disjoint paths in symmetric digraphs.
Discrete Applied Mathematics, 2009

From Balls and Bins to Points and Vertices.
Algorithmic Operations Research, 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.
Wireless 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. Discrete Math., 2007

Shared Risk Resource Group Complexity and Approximability Issues.
Parallel Processing Letters, 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

Hardness and Approximation of Traffic Grooming.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Hardness and Approximation of Gathering in Static Radio Networks.
Parallel Processing Letters, 2006

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

About the Lifespan of Peer to Peer Networks
CoRR, 2006

Hardness and approximation of Gathering in static radio networks.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 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.
Discrete Applied Mathematics, 2005

The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Asymptotically Optimal Solutions for Small World Graphs.
Proceedings of the Distributed Computing, 19th International Conference, 2005

From Balls and Bins to Points and Vertices.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

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

Distance labeling in graphs.
J. Algorithms, 2004

Approximate constrained bipartite edge coloring.
Discrete Applied Mathematics, 2004

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

Improved approximation results for the minimum energy broadcasting problem.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 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.
Telecommunication Systems, 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. Geometry Appl., 2003

Deadlock Prevention by Acyclic Orientations.
Discrete Applied Mathematics, 2003

The Power of Small Coalitions in Graphs.
Discrete Applied Mathematics, 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

Disjoint Paths in Symmetric Digraphs.
Proceedings of the SIROCCO 9, 2002

Hierarchical Ring Network Design.
Proceedings of the SIROCCO 9, 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. Discrete Math., 2001

Efficient communication in unknown networks.
Networks, 2001

Tight Bounds for Broadcasting in the Linear Cost Model.
Journal of Interconnection Networks, 2001

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

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

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

Approximate Constrained Bipartite Edge Coloring.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Distance labeling in graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 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.
Electronic Notes in Discrete Mathematics, 2000

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

Efficient Communication in Unknown Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

The Minimum Range Assignment Problem on Linear Radio Networks.
Proceedings of the Algorithms, 2000

1999
All-to-All Routing and Coloring in Weighted Trees of Rings.
SPAA, 1999

1998
Neighbourhood Gossiping in Hypercubes.
Parallel Processing Letters, 1998

Hamilton Cycle Decomposition of the Butterfly Network.
Parallel Processing Letters, 1998

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks.
Discrete Applied Mathematics, 1998

Large Generalized Cycles.
Discrete Applied Mathematics, 1998

Optimal Sequential Gossiping by Short Messages.
Discrete Applied Mathematics, 1998

Hamilton Circuits in the Directed Wrapped Butterfly Network.
Discrete Applied Mathematics, 1998

Optimal Wavelength-routed Multicasting.
Discrete Applied Mathematics, 1998

Directed Virtual Path Layouts in ATM Networks.
Proceedings of the Distributed Computing, 12th International Symposium, 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.
Discrete Applied Mathematics, 1997

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

Lower Bounds on Systolic Gossip.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 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 Distrib. 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

Efficient Collective Communication in Optical Networks.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 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
Optimal Information Dissemination in Star and Pancake Networks.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

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


  Loading...