Yann Vaxès

According to our database1, Yann Vaxès authored at least 45 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graphs with G<sup>p</sup>-connected medians.
Math. Program., January, 2024

2023
Sample Compression Schemes for Balls in Graphs.
SIAM J. Discret. Math., December, 2023

Optimizing the ecological connectivity of landscapes.
Networks, March, 2023

Isometric Path Complexity of Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Medians in median graphs and their cube complexes in linear time.
J. Comput. Syst. Sci., 2022

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G<sup>2</sup>-connected medians.
CoRR, 2022

2021
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.
Discret. Comput. Geom., 2021

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing.
CoRR, 2021

2019
Fast approximation of eccentricities and distances in hyperbolic graphs.
J. Graph Algorithms Appl., 2019

Medians in median graphs in linear time.
CoRR, 2019

2018
Fast Approximation of Centrality and Distances in Hyperbolic Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Maximum flow under proportional delay constraint.
Theor. Comput. Sci., 2017

Bidirected minimum Manhattan network problem.
Networks, 2017

The Maximum Labeled Path Problem.
Algorithmica, 2017

Core congestion is inherent in hyperbolic networks.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Convergecast and Broadcast by Power-Aware Mobile Agents.
Algorithmica, 2016

2013
Retracts of Products of Chordal Graphs.
J. Graph Theory, 2013

2012
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.
Discret. Comput. Geom., 2012

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.
Algorithmica, 2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.
Algorithmica, 2012

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.
Algorithmica, 2012

Collecting Information by Power-Aware Mobile Agents.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011
Embedding into the rectilinear plane in optimal O(n<sup>2</sup>) time.
Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.
SIAM J. Discret. Math., 2011

2010
Pareto Envelopes in Simple Polygons.
Int. J. Comput. Geom. Appl., 2010

Planar Hop Spanners for Unit Disk Graphs.
Proceedings of the Algorithms for Sensor Systems, 2010

2009
Embedding into the rectilinear plane in optimal O*(n^2)
CoRR, 2009

2008
A rounding algorithm for approximating minimum Manhattan networks.
Theor. Comput. Sci., 2008

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.
Theor. Comput. Sci., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.
Electron. Notes Discret. Math., 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Covering Planar Graphs with a Fixed Number of Balls.
Discret. Comput. Geom., 2007

2006
Addressing, distances and routing in triangular systems with applications in cellular networks.
Wirel. Networks, 2006

Distance and routing labeling schemes for non-positively curved plane graphs.
J. Algorithms, 2006

2005
Lowering eccentricity of a tree by node upgrading.
Networks, 2005

Mixed covering of trees and the augmentation problem with odd diameter constraints.
Electron. Notes Discret. Math., 2005

Distance-Based Location Update and Routing in Irregular Cellular Networks.
Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

2004
Median problem in some plane triangulations and quadrangulations.
Comput. Geom., 2004

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Upgrading trees under diameter and budget constraints.
Networks, 2003

On covering bridged plane triangulations with balls.
J. Graph Theory, 2003

2002
Augmenting Trees to Meet Biconnectivity and Diameter Constraints.
Algorithmica, 2002

Center and diameter problems in plane triangulations and quadrangulations.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000
A primal partitioning approach for single and non-simultaneous multicommodity flow problems.
Eur. J. Oper. Res., 2000

1997
Multicommodity network flow with jump constraints.
Discret. Math., 1997


  Loading...