Search the dblp DataBase

Publications of Author

1. Victor Chepoi, Karim Nouioua, Yann Vaxès
   A Rounding Algorithm for Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2005, pp:40-51 [Conf]
   
2. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
   Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. [Citation Graph (0, 0)][DBLP]
   IPDPS, 2004, pp:- [Conf]
   
3. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
   Distance-Based Location Update and Routing in Irregular Cellular Networks. [Citation Graph (0, 0)][DBLP]
   SNPD, 2005, pp:380-387 [Conf]
   
4. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
   Center and diameter problems in plane triangulations and quadrangulations. [Citation Graph (0, 0)][DBLP]
   SODA, 2002, pp:346-355 [Conf]
   
5. Victor Chepoi, Bertrand Estellon, Yann Vaxès
   Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. [Citation Graph (0, 0)][DBLP]
   WADS, 2005, pp:282-293 [Conf]
   
6. Victor Chepoi, Yann Vaxès
   Augmenting Trees to Meet Biconnectivity and Diameter Constraints. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:243-262 [Journal]
   
7. Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès
   Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2006, v:45, n:2, pp:209-226 [Journal]
   
8. Victor Chepoi, Clémentine Fanciullini, Yann Vaxès
   Median problem in some plane triangulations and quadrangulations. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:27, n:3, pp:193-210 [Journal]
   
9. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
   Distance and routing labeling schemes for non-positively curved plane graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2006, v:61, n:2, pp:60-88 [Journal]
   
10. Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
    Upgrading trees under diameter and budget constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:24-35 [Journal]
    
11. Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang
    Lowering eccentricity of a tree by node upgrading. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:232-239 [Journal]
    
12. Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
    A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:81-95 [Conf]
    
13. Victor Chepoi, Bertrand Estellon, Yann Vaxès
    Covering Planar Graphs with a Fixed Number of Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:2, pp:237-244 [Journal]
    
14. Jean François Maurras, Yann Vaxès
    Multicommodity network flow with jump constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:481-486 [Journal]
    
15. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Addressing, distances and routing in triangular systems with applications in cellular networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:671-679 [Journal]
    
16. 
    Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Embedding into the rectilinear plane in optimal O*(n^2) [Citation Graph (, )][DBLP]
    
    
19. 
    Cop and robber games when the robber can hide and ride [Citation Graph (, )][DBLP]
    
    
20. 
    Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs [Citation Graph (, )][DBLP]