The following pages link to Stéphane Pérennes (Q166298):
Displaying 50 items.
- (Q243618) (redirect page) (← links)
- (Q325418) (redirect page) (← links)
- Optimal time data gathering in wireless networks with multidirectional antennas (Q392209) (← links)
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Design of fault-tolerant on-board networks with variable switch sizes (Q476844) (← links)
- (Q591807) (redirect page) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Asymptotically optimal solutions for small world graphs (Q927399) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Symmetric flows and broadcasting in hypercubes (Q1296143) (← links)
- (Q1356509) (redirect page) (← links)
- A proof of Jean de Rumeur's conjecture (Q1356510) (← links)
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks (Q1392538) (← links)
- Optimal wavelength-routed multicasting (Q1392558) (← links)
- Hamilton circuits in the directed wrapped Butterfly network (Q1392560) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- The minimum range assignment problem on linear radio networks (Q1566370) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- Hierarchical ring network design (Q1762997) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- Virtual network embedding in the cycle (Q1765514) (← links)
- Directed virtual path layouts in ATM networks (Q1870524) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Eternal domination in grids (Q2294061) (← links)
- Connected surveillance game (Q2345464) (← links)
- Maintaining balanced trees for structured distributed streaming systems (Q2410236) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between (Q2663714) (← links)
- A random growth model with any real or theoretical degree distribution (Q2699948) (← links)
- On the optimality of general lower bounds for broadcasting and gossiping (Q2719169) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- (Q2753931) (← links)
- (Q2766680) (← links)
- Distance labeling in graphs (extended abstract) (Q2768294) (← links)
- How to Design Graphs with Low Forwarding Index and Limited Number of Edges (Q2798234) (← links)
- Connectivity Inference in Mass Spectrometry Based Structure Determination (Q2849320) (← links)
- From balls and bins to points and vertices (Q2867370) (← links)
- Connected Surveillance Game (Q2868632) (← links)
- Maintaining Balanced Trees for Structured Distributed Streaming Systems (Q2868643) (← links)
- Cross line and column generation for the cut covering problem in wireless networks (Q2883571) (← links)
- Memory requirement for routing in distributed networks (Q2942724) (← links)
- Weighted Coloring in Trees (Q2965473) (← links)
- (Q2965980) (← links)
