The following pages link to Stéphane Pérennes (Q166298):
Displaying 38 items.
- Bin Packing with Colocations (Q2971155) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- The “real” approximation factor of the MST heuristic for the minimum energy broadcasting (Q3507779) (← links)
- Neighborhood Broadcasting in Hypercubes (Q3544237) (← links)
- On the Path-Width of Planar Graphs (Q3583303) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- A Note on the Dimensionality of Modified Knödel Graphs (Q4358513) (← links)
- (Q4373669) (← links)
- (Q4448743) (← links)
- (Q4535060) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- On the complexity of equal shortest path routing (Q4565765) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols (Q4652605) (← links)
- Isomorphisms of the De Bruijn digraph and free‐space optical networks (Q4785231) (← links)
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS (Q4818577) (← links)
- (Q4818867) (← links)
- Distance labeling in graphs (Q4826764) (← links)
- GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)
- (Q5136239) (← links)
- Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
- Assigning labels in unknown anonymous networks (extended abstract) (Q5176776) (← links)
- Weighted Coloring in Trees (Q5246102) (← links)
- (Q5282808) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)
- Distributed Computing (Q5395160) (← links)
- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions (Q5425975) (← links)
- Experimental and Efficient Algorithms (Q5710045) (← links)
- Interest clustering coefficient: a new metric for directed networks like Twitter (Q5861617) (← links)
- Grid spanners with low forwarding index for energy efficient networks (Q5890943) (← links)
- Algorithms and Computation (Q5897908) (← links)
- Grid spanners with low forwarding index for energy efficient networks (Q5915675) (← links)
- Sequential metric dimension (Q5916085) (← links)
- Sequential metric dimension (Q5918179) (← links)
- Complete rotations in Cayley graphs (Q5927685) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)
- Gossiping in Cayley graphs by packets (Q6567690) (← links)
