The following pages link to Florian Huc (Q455961):
Displayed 15 items.
- On the efficiency of routing in sensor networks (Q455964) (← links)
- Virtual raw anchor coordinates: a new localization paradigm (Q714768) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
- Subgraphs of Weakly Quasi-Random Oriented Graphs (Q3094909) (← links)
- THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS (Q3166742) (← links)
- Pathwidth of outerplanar graphs (Q3445500) (← links)
- 4-cycles in mixing digraphs (Q3503531) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- WDM and Directed Star Arboricity (Q3557532) (← links)
- On the Path-Width of Planar Graphs (Q3583303) (← links)
- Fast byzantine agreement (Q5176082) (← links)
- Highly dynamic distributed computing with byzantine failures (Q5176093) (← links)
- (l,k)-Routing on Plane Grids (Q6208810) (← links)