The following pages link to Yann Vaxès (Q261351):
Displaying 49 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- The maximum labeled path problem (Q527429) (← links)
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time (Q533893) (← links)
- (Q664542) (redirect page) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- (Q878064) (redirect page) (← links)
- Covering planar graphs with a fixed number of balls (Q878065) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- Multicommodity network flow with jump constraints (Q1356790) (← links)
- Median problem in some plane triangulations and quadrangulations. (Q1428459) (← links)
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← links)
- (Q1601018) (redirect page) (← links)
- Augmenting trees to meet biconnectivity and diameter constraints (Q1601019) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Fast approximation of centrality and distances in hyperbolic graphs (Q2327101) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113) (← links)
- The Maximum Labeled Path Problem (Q2945186) (← links)
- PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
- Cop and Robber Games When the Robber Can Hide and Ride (Q3094914) (← links)
- Distance and routing labeling schemes for non-positively curved plane graphs (Q3414546) (← links)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs (Q3602902) (← links)
- On covering bridged plane triangulations with balls (Q4434549) (← links)
- Bidirected minimum Manhattan network problem (Q4565780) (← links)
- Core congestion is inherent in hyperbolic networks (Q4575897) (← links)
- Upgrading trees under diameter and budget constraints (Q4797944) (← links)
- (Q4828953) (← links)
- Collecting Information by Power-Aware Mobile Agents (Q4909401) (← links)
- Retracts of Products of Chordal Graphs (Q4920657) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
- Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs (Q5301013) (← links)
- Algorithms and Data Structures (Q5394257) (← links)
- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives (Q5425962) (← links)
- Lowering eccentricity of a tree by node upgrading (Q5463675) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479357) (← links)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5899375) (← links)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← links)
- Sample Compression Schemes for Balls in Graphs (Q6069434) (← links)
- Graphs with \(G^p\)-connected medians (Q6120939) (← links)
- Optimizing the ecological connectivity of landscapes (Q6179718) (← links)
- Sample compression schemes for balls in graphs (Q6584025) (← links)
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians (Q6633522) (← links)
- Isometric path complexity of graphs (Q6647660) (← links)
