The following pages link to Cyril Gavoille (Q202142):
Displayed 50 items.
- Local Computation of Nearly Additive Spanners (Q3646224) (← links)
- What Can Be Observed Locally? (Q3646229) (← links)
- Worst Case Bounds for Shortest Path Interval Routing (Q4209271) (← links)
- (Q4418676) (← links)
- (Q4437127) (← links)
- (Q4448760) (← links)
- (Q4509345) (← links)
- (Q4535803) (← links)
- Simpler, faster and shorter labels for distances in graphs (Q4575602) (← links)
- (Q4636501) (← links)
- The Compactness of Interval Routing (Q4699171) (← links)
- (Q4699302) (← links)
- (Q4736828) (← links)
- (Q4796196) (← links)
- Compact routing schemes with low stretch factor (Q4808315) (← links)
- Distance labeling in graphs (Q4826764) (← links)
- An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps (Q4900004) (← links)
- (Q4944982) (← links)
- Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension (Q4962222) (← links)
- Compact name-independent routing with minimum stretch (Q4962742) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
- Universal routing schemes (Q5137328) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5146793) (← links)
- Forbidden-set distance labels for graphs of bounded doubling dimension (Q5176198) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) (Q5176767) (← links)
- Object location using path separators (Q5177280) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Cops, robbers, and threatening skeletons (Q5259541) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- Structural Information and Communication Complexity (Q5315220) (← links)
- A characterization of networks supporting linear interval routing (Q5361412) (← links)
- Memory requirement for universal routing schemes (Q5361458) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- Distributed Computing (Q5395162) (← links)
- On local representation of distances in trees (Q5401458) (← links)
- Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (Q5415545) (← links)
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring (Q5428812) (← links)
- Routing with Improved Communication-Space Trade-Off (Q5464200) (← links)
- Eclecticism shrinks even small worlds (Q5501496) (← links)
- Structural Information and Communication Complexity (Q5710087) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710808) (← links)
- Distributed Data Structures: A Survey on Informative Labeling Schemes (Q5756710) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Algorithms - ESA 2003 (Q5897251) (← links)
- Distributed Computing (Q5897409) (← links)
- Algorithms and Computation (Q5897938) (← links)
- Algorithms and Computation (Q5897943) (← links)