Yann Vaxès

	2009
21		Nicolas Catusse, Victor Chepoi, Yann Vaxès: Embedding into the rectilinear plane in optimal O*(n^2) CoRR abs/0910.1059: (2009)
	2008
20		Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. Symposium on Computational Geometry 2008: 59-68
19		Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès: Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electronic Notes in Discrete Mathematics 31: 231-234 (2008)
18		Victor Chepoi, Karim Nouioua, Yann Vaxès: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008)
17		Victor Chepoi, Bertrand Estellon, Yann Vaxès: Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theor. Comput. Sci. 401(1-3): 131-143 (2008)
	2007
16		Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès: A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. SIROCCO 2007: 81-95
15		Victor Chepoi, Bertrand Estellon, Yann Vaxès: Covering Planar Graphs with a Fixed Number of Balls. Discrete & Computational Geometry 37(2): 237-244 (2007)
	2006
14		Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès: Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006)
13		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61(2): 60-88 (2006)
12		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Addressing, distances and routing in triangular systems with applications in cellular networks. Wireless Networks 12(6): 671-679 (2006)
	2005
11		Victor Chepoi, Karim Nouioua, Yann Vaxès: A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51
10		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387
9		Victor Chepoi, Bertrand Estellon, Yann Vaxès: Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS 2005: 282-293
8		Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès: Mixed covering of trees and the augmentation problem with odd diameter constraints. Electronic Notes in Discrete Mathematics 22: 405-408 (2005)
7		Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang: Lowering eccentricity of a tree by node upgrading. Networks 45(4): 232-239 (2005)
	2004
6		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004
5		Victor Chepoi, Clémentine Fanciullini, Yann Vaxès: Median problem in some plane triangulations and quadrangulations. Comput. Geom. 27(3): 193-210 (2004)
	2003
4		Victor Chepoi, Hartmut Noltemeier, Yann Vaxès: Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003)
	2002
3		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355
2		Victor Chepoi, Yann Vaxès: Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2): 243-262 (2002)
	1997
1		Jean François Maurras, Yann Vaxès: Multicommodity network flow with jump constraints. Discrete Mathematics 165-166: 481-486 (1997)

Coauthor Index

1	Nicolas Catusse	[21]
2	Victor Chepoi	[2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21]
3	Feodor F. Dragan	[3] [6] [10] [12] [13] [19] [20]
4	Bertrand Estellon	[8] [9] [14] [15] [17] [19] [20]
5	Clémentine Fanciullini	[5]
6	Tristan Fevat	[16]
7	Emmanuel Godard	[16]
8	Michel Habib	[19] [20]
9	Toshihide Ibaraki	[7]
10	Jean François Maurras	[1]
11	Hartmut Noltemeier	[4]
12	Karim Nouioua	[8] [11] [14] [18]
13	Xiao-guang Yang	[7]

Colors in the list of coauthors