The following pages link to Laurent Viennot (Q216238):
Displaying 37 items.
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Fast diameter computation within split graphs (Q2180143) (← links)
- Independent lazy better-response dynamics on network games (Q2294066) (← links)
- Self-organizing flows in social networks (Q2345453) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- Linear time recognition of \(P_4\)-indifference graphs (Q2752464) (← links)
- Self-organizing Flows in Social Networks (Q2868636) (← links)
- Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners (Q2900968) (← links)
- On the locality of distributed sparse spanner construction (Q2934351) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
- LiveRank: How to Refresh Old Crawls (Q2945282) (← links)
- (Q3045077) (← links)
- Asymptotic Modularity of Some Graph Classes (Q3104638) (← links)
- Multipath Spanners (Q3569127) (← links)
- Local Computation of Nearly Additive Spanners (Q3646224) (← links)
- Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons (Q4575838) (← links)
- Parallel comparability graph recognition and modular decomposition (Q4593927) (← links)
- (Q4708654) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5092347) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q5136231) (← links)
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (Q5145219) (← links)
- Diameter computation on <i>H</i>-minor free graphs and graphs of bounded (distance) VC-dimension (Q5146902) (← links)
- Average size of unstretched Remote-Spanners (Q5194661) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- LiveRank: How to Refresh Old Datasets (Q5856431) (← links)
- Some algorithms for synchronizing clocks of base transceiver stations in a cellular network (Q5949538) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)
- Revisiting the Random Subset Sum problem (Q6507820) (← links)
- Temporalizing digraphs via linear-size balanced bi-trees (Q6509570) (← links)
- Computing graph hyperbolicity using dominating sets (Q6543129) (← links)
- Revisiting the random subset sum problem (Q6656983) (← links)
- Bow Metrics and Hyperbolicity (Q6755023) (← links)
- On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs (Q6763847) (← links)
