The following pages link to Cyril Gavoille (Q202142):
Displayed 50 items.
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Nearest common ancestors: a survey and a new algorithm for a distributed environment (Q706323) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Item:Q202142 (redirect page) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- A survey on interval routing (Q1575744) (← links)
- Recognizing Knödel graphs (Q1613433) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- Localisation-resistant random words with small alphabets (Q2333040) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Eclecticism shrinks even small worlds (Q2375296) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Header-size lower bounds for end-to-end communication in memoryless networks (Q2495487) (← links)
- Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
- (Q2753924) (← links)
- (Q2768294) (← links)
- The Compactness of Interval Routing for Almost All Graphs (Q2784477) (← links)
- (Q2816089) (← links)
- On the Path Separability of Planar Graphs (Q2851515) (← links)
- On the Tree-Width of Planar Graphs (Q2851524) (← links)
- Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners (Q2900968) (← links)
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations (Q2912842) (← links)
- On the locality of distributed sparse spanner construction (Q2934351) (← links)
- Memory requirement for routing in distributed networks (Q2942724) (← links)
- Towards plane spanners of degree 3 (Q2970473) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation (Q3378515) (← links)
- Optimal Distance Labeling for Interval Graphs and Related Graph Families (Q3395001) (← links)
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs (Q3438963) (← links)
- Edge Partition of Toroidal Graphs into Forests in Linear Time (Q3439375) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time (Q3523207) (← links)
- On the Complexity of Distributed Greedy Coloring (Q3523231) (← links)
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs (Q3527249) (← links)
- Multipath Spanners (Q3569127) (← links)
- Path Separability of Graphs (Q3587357) (← links)
- Plane Spanners of Maximum Degree Six (Q3587366) (← links)
- Fast Deterministic Distributed Algorithms for Sparse Spanners (Q3613647) (← links)