I agree that this site is using cookies. You can find further informations here.
X
Chepoi, V.
20  results:
Search for persons X
?
1

Two Simple but Efficient Algorithms to Recognize Robinson D..:

Carmona, M. ; Chepoi, V. ; Naves, G..
Journal of Classification.  , 2023
Link: https://doi.org/10.1007/..
 
?
2

Fast Approximation of Centrality and Distances in Hyperboli..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
Chepoi, V. ; Dragan, F. F. ; Habib, M... - p. 3-18 , 2018
Link: https://doi.org/10.1007/..
 
?
3

Bucolic complexes:

Brešar, B. ; Chalopin, J. ; Chepoi, V...
Advances in Mathematics.  243 (2013)  - p. 127-167 , 2013
Link: https://doi.org/10.1016/..
 
?
4

Minimum Manhattan Network Problem in Normed Planes with Pol..:

Catusse, N. ; Chepoi, V. ; Nouioua, K..
Algorithmica.  63 (2011)  1-2 - p. 551-567 , 2011
Link: https://doi.org/10.1007/..
 
?
5

Constant Approximation Algorithms for Embedding Graph Metri..:

Chepoi, V. ; Dragan, F. F. ; Newman, I...
Discrete & Computational Geometry.  47 (2011)  1 - p. 187-214 , 2011
Link: https://doi.org/10.1007/..
 
?
6

Augmenting Trees to Meet Biconnectivity and Diameter Constr..:

Chepoi, V. ; Vaxes, Y.
Algorithmica.  33 (2002)  2 - p. 243-262 , 2002
Link: https://doi.org/10.1007/..
 
?
7

A note on distance approximating trees in graphs:

CHEPOI, V ; DRAGAN, F
Electronic Notes in Discrete Mathematics.  3 (2000)  - p. 1 , 2000
Link: https://doi.org/10.1016/..
 
?
8

A note on distance approximating trees in graphs:

Chepoi, V. ; Dragan, F.
Electronic Notes in Discrete Mathematics.  3 (1999)  - p. 39 , 1999
Link: https://doi.org/10.1016/..
 
?
9

Embedding into Rectilinear Spaces:

-J. Bandelt, H. ; Chepoi, V. ; Laurent, M.
Discrete & Computational Geometry.  19 (1998)  4 - p. 595-604 , 1998
Link: https://doi.org/10.1007/..
 
?
10

Embedding metric spaces in the rectilinear plane: A six-poi..:

Bandelt, H. -J. ; Chepoi, V.
Discrete & Computational Geometry.  15 (1996)  1 - p. 107-117 , 1996
Link: https://doi.org/10.1007/..
 
?
11

Generalized Weber problem for discrete median spaces:

Chepoi, V. D.
Cybernetics and Systems Analysis.  27 (1991)  1 - p. 81-92 , 1991
Link: https://doi.org/10.1007/..
 
?
12

Centers of triangulated graphs:

Chepoi, V. D.
Mathematical Notes of the Academy of Sciences of the USSR.  43 (1988)  1 - p. 82-86 , 1988
Link: https://doi.org/10.1007/..
 
?
13

Isometric subgraphs of Hamming graphs and d-convexity:

Chepoi, V. D.
Cybernetics.  24 (1988)  1 - p. 6-11 , 1988
Link: https://doi.org/10.1007/..
 
?
14

Conditions for invariance of set diameters under d-convexif..:

Soltan, V. P. ; Chepoi, V. D.
Cybernetics.  19 (1984)  6 - p. 750-756 , 1984
Link: https://doi.org/10.1007/..
 
?
15

Two simple but efficient algorithms to recognize Robinson d..:

Carmona, M ; Chepoi, V ; Naves, G.
hal-04158896.  , 2022
Link: https://hal.science/hal-..
 
1-15