Source: http://pageperso.lif.univ-mrs.fr/~yann.vaxes/pub.html
Timestamp: 2019-04-18 14:47:00+00:00

Document:
B. Couëtoux, E. Nakache, Y. Vaxès, The maximum labeled path problem. Algorithmica 78 (2017) 298-318, short version: WG 2014, pp. 152-163.
P. Bonami, D. Mazauric, Y. Vaxès, Maximum flow under proportional delay constraint. TCS 689 (2017) 58-66.
V. Chepoi, Feodor F. Dragan, Y. Vaxès, Core congestion is inherent in hyperbolic networks. SODA 2017, 2264-2279.
N. Catusse, V. Chepoi, K. Nouioua, Y. Vaxès, Bidirected minimum Manhattan network problem. Networks 69 (2017) 167-178.
J. Anaya, J. Chalopin, J. Czyzowicz, A. Labourel, A. Pelc, Y. Vaxès, Convergecast and broadcast by power-Aware mobile agents. Algorithmica 74 (2016) 117-155.
B. Bresar, J. Chalopin, V. Chepoi, M. Kovse, A. Labourel, Y. Vaxès, Retracts	of products of chordal graphs. Journal of Graph Theory 73 (2013), 161-180.
J. Anaya, J. Chalopin, J. Czyzowicz, A. Labourel, A. Pelc, Y. Vaxès, Collecting information by power-aware mobile agents. DISC 2012, 46-60.
N. Catusse, V. Chepoi, K. Nouioua, Y. Vaxès, Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. Algorithmica 62 (2012), 551-567.
V. Chepoi, F. Dragan, I. Newman,Y. Rabinovich, Y. Vaxès, Constant	approximation algorithms for embedding graph metrics into trees and outerplanar graphs, Discrete & Computational Geometry 47 (2012), 187-214, short version: APPROX-RANDOM 2010.
V. Chepoi, F. Dragan, B. Estellon, M. Habib, Y. Vaxès, Y. Xiang, Additive spanners and distance and routing labeling schemes for delta-hyperbolic graphs. Algorithmica 62 (2012) 713-732.
N. Catusse, V. Chepoi, Y. Vaxès, Embedding into the rectilinear plane in optimal O(n^2) time. Theoretical Computer Science 412 (2011), 2425-2433.
J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès, Cop and robber games when the robber can hide and ride. SIAM J. Discrete Math. 25 (2011) 333-359.
N. Catusse, V. Chepoi, Y. Vaxès, Planar hop spanners for unit disk graphs. ALGOSENSORS 2010, 16-30.
V. Chepoi, K. Nouioua, E. Thiel and Y. Vaxès, Pareto envelopes in simple polygons. In EWCG #24, European Workshop on Comp. Geom., March 18--20, 2008, Nancy, France. Full version appeared in Int. J. Comput. Geometry Appl. 20 (2010) 707-721.
V. Chepoi, F. Dragan, B. Estellon, M. Habib, Y. Vaxès, Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. 24th Symposium on Computational Geometry SoCG'08, pp. 59-68.
V. Chepoi, T. Fevat, E. Godard, and Y. Vaxès, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives. Algorithmica 62 (2012) 146-168, short version: SIROCCO'07, 2007, pp. 81-95.
V. Chepoi, F. Dragan, Y. Vaxès, Distance-based location update and routing in irregular cellular networks. Proc. of 1st workshop on Self-Assembling Wireless Networks, SAWN'05.
V. Chepoi, B. Estellon, Y. Vaxès, On covering planar graphs with a fixed number of balls. Discrete Comput. Geom. 37 (2007) 237-244.
V. Chepoi, B. Estellon, K. Nouioua, Y. Vaxès. Mixed covering of trees and the augmentation problem with odd diameter constraints. Algorithmica 45 (2006) 209-226.
V. Chepoi, B. Estellon, Y. Vaxès. Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. In Proc. of the Workshop on Algorithms and Data Structures, WADS'05, LNCS 3608, 282-293. Full version appeared in Theor. Comput. Sci. 401 (2008) 131-143.
V. Chepoi, K. Nouioua, Y. Vaxès. A rounding algorithm for approximating minimum Manhattan networks. In Proc. of the 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'05, LNCS 3624, 40-51. Full version appeared in Theor. Comput. Sci. 390 (2008) 56-69.
T. Ibaraki, Y. Vaxès, X.-G. Yang. Lowering eccentricity of a tree by node upgrading. 45(4) Networks, 232-239 (2005).
V. Chepoi, F. Dragan, Y. Vaxès. Distance and routing labeling scheme for non-positively curved plane graphs. Journal of Algorithms 61 (2006) 1-30.
V. Chepoi, F. Dragan, Y. Vaxès. Addressing, distances and routing in triangular systems with applications in cellular and sensor network. Proc. of the 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN'04.
V. Chepoi, C. Fanciullini, Y. Vaxès. Median problem in some plane triangulations and quadrangulations. Computational Geometry 27 (2004) 193-210.
V. Chepoi, Y. Vaxès. On covering plane bridged triangulations with balls. Journal of Graph Theory, 44 (2003) 65-80.
V. Chepoi, H. Noltemeier, Y. Vaxès. Updrading trees under diameter and budget constraints. Networks, 41 (2003) 24-35.
M.Kovalev, J.-F. Maurras, Y. Vaxès. On the convex hull of 3-cycles of the complete graph. Pesquisa Operational, 23 (2003) 99-109.
V. Chepoi, F. Dragan, Y. Vaxès. Center and diameter problems in plane triangulations and quadrangulations (extended abstract). SODA 2002, 346-355.
V. Chepoi, Y. Vaxès. Augmenting trees to meet biconnectivity and diameter requirements. Algorithmica, 33 (2002) 243-262.
M. Hadjiat, J-F. Maurras, Y. Vaxès. A primal partitioning approach for single and non-simultaneous multicommodity flow problems. European J. Operational Research, 123 (2000) 382-393.
J-F. Maurras, Y. Vaxès. Multicommodity flow with jump constraints. Discrete Mathematics, 166 (1997) 481-486.
J-M. Bienfait, P. Préa, Y. Vaxès. Sequences with Unique Sums and Differences : Solution to Problem 96-3. SIAM Review , 39 (1997) 138-140.

References: V. 
 V. 
 V. 
 V. 

V. 

V. 
 V. 
 V. 
 V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V. 

V.