- DUALLY CHORDAL GRAPHS ANDREAS BRANDSTADT, FEODOR DRAGAN, VICTOR CHEPOI, AND
- Embedding into the Rectilinear Grid Hans-Ju rgen Bandelt,1
- ARTICLE IN PRESS European Journal of Combinatorics ( )
- MATHEMATICS ELSEVIER Discrete Mathematics 160 (1996) 25 39
- Center and diameter problems in plane triangulations and quadrangulations Victor Chepoi 1 Feodor Dragan 2 Yann Vaxes 1
- Preliminaries Characterizations Algorithms Conclusions Pareto envelopes in R3
- Z .ADVANCES IN APPLIED MATHEMATICS 19, 453 470 1997 ARTICLE NO. AM970549
- Discrete Applied Mathematics 131 (2003) 93111 www.elsevier.com/locate/dam
- Approximating hitting sets of axis-parallel rectangles with opposite corners separated by a monotone curve
- ELSEVIER Discrete Mathematics 183 (1998) 47--60 MATHEMATICS
- Discrete Applied Mathematics 64 (1996) l-29 MATHEMATICS
- Accepted Manuscript A rounding algorithm for approximating minimum Manhattan
- A rounding algorithm for approximating minimum Manhattan networks1
- Geometriae Dedicata 69: 237240, 1998. 237 c 1998 Kluwer Academic Publishers. Printed in the Netherlands.
- CENTERS OF TRIANGULATED GRAPHS V. D. Chepoi
- Discrete Comput Geom 15:107117 (1996) Discrete & Computational Geometry 1996 Springer-Verlag New York Inc.
- Diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs
- Europ. J. Combinatorics (1996) 17, 121134 Cellular Bipartite Graphs
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- On staircase starshapedness in rectilinear spaces VICTOR CHEPOI 1
- Distance approximating trees for chordal and dually chordal graphs \Lambda Andreas Brandstadt 1 , Victor Chepoi 2 y and Feodor Dragan 1 y
- Theoretical Computer Science 290 (2003) 15031540 www.elsevier.com/locate/tcs
- Shortest path problem in rectangular complexes of global nonpositive curvature
- ARTICLE IN PRESS European Journal of Combinatorics ( )
- On covering planar graphs with a fixed number of balls Victor Chepoi, Bertrand Estellon, Yann Vax`es
- Journal of Mathematical Psychology 44, 600 616 (2000) l -Approximation via Subdominants
- RAMIFIED RECTILINEAR POLYGONS: COORDINATIZATION BY DENDRONS
- Combinatorics and geometry of finite and infinite squaregraphs HansJurgen Bandelt1, Victor Chepoi2, and David Eppstein3
- On distance--preserving and domination elimination orderings Victor Chepoi 1
- The algebra of metric betweenness II: geometry and equational characterization of weakly median graphs
- Article No. 10.1006/eujc.1999.0378 Available online at http://www.idealibrary.com on
- ARTICLE IN PRESS YJCTB:2408 JID:YJCTB AID:2408 /FLA [m1+; v 1.60; Prn:7/06/2006; 16:40] P.1 (1-18)
- Advances in Applied Mathematics 24, 125179 (2000) doi:10.1006/aama.1999.0677, available online at http://www.idealibrary.com on
- DistanceBased Location Update and Routing in Irregular Cellular Networks
- Embedding into the rectilinear plane in optimal O(n2 Nicolas Catusse, Victor Chepoi, and Yann Vax`es
- MATHEMATICS EISEVIER Discrete Mathematics 192 (1998) 27-39
- Packing and covering -hyperbolic spaces by balls
- EISEYIER Discrete Applied Mathematics 73 (1997) 175-189 MATHEMATICS
- 1-HYPERBOLIC GRAPHS Hans{J urgen Bandelt 1 and Victor Chepoi 2
- Theoretical Computer Science 347 (2005) 5475 www.elsevier.com/locate/tcs
- Algorithmica DOI 10.1007/s00453-009-9319-y
- Pareto envelopes in simple polygons 1 Victor Chepoi, Karim Nouioua, Edouard Thiel, and Yann Vax`es
- Pareto envelopes in simple polygons Victor Chepoi
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives1
- Seriation in the presence of errors: NP-hardness of l-fitting Robinson structures to dissimilarity matrices
- DOI: 10.1007/s00453-005-1183-9 Algorithmica (2006) OF1OF18
- Contemporary Mathematics Metric graph theory and geometry: a survey
- ARTICLE IN PRESS S0196-6774(04)00141-5/FLA AID:1396 Vol.() [DTD5] P.1 (1-29)
- ARTICLE IN PRESS European Journal of Combinatorics ( )
- Wireless Netw (2006) 12:671679 DOI 10.1007/s11276-006-6527-0
- Available online at www.sciencedirect.com Computational Geometry 27 (2004) 193210
- Upgrading Trees Under Diameter and Budget Constraints
- On Covering Bridged Plane Triangulations with Balls
- DOI: 10.1007/s00453-001-0113-8 Algorithmica (2002) 33: 243262
- Article No. 10.1006/eujc.1999.0377 Available online at http://www.idealibrary.com on
- Discrete Comput Geom 19:595604 (1998) Discrete & Computational Geometry 1998 Springer-Verlag New York Inc.
- Discrete Applied Mathematics 80 (1997) 3-l 9 MATHEMATICS
- On Distances in Benzenoid Systems Victor Chepoi
- Europ. J. Combinatorics (1996) 17, 113120 Graphs of Acyclic Cubical Complexes
- Arch. Math., Vol. 64, 264-268 (t995) 0003-889X/95/6403-0264 $ 2.50/0 9 1995 Birkh/iuser Verlag, Basel
- A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph *
- Here it is assumed that the graphs G and H are assigned on the same set of vertices. It hence follows that all the elements of M(GI) and M(HI) are positive, i.e., Hz is a sub-
- arXiv:submit/0032550[cs.CG]30Apr2010 Minimum Manhattan network problem in normed planes
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs1
- GRAPHS WITH CONNECTED MEDIANS Hans--J urgen Bandelt 1 and Victor Chepoi 2 \Lambda
- The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time Victor Chepoi*
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- journal of combinatorial theory, Series B 69, 97 100 (1997) Bridged Graphs Are Cop-Win Graphs
- CLIQUE r-DOMINATION AND CLIQUE r-PACKING PROBLEMS ON DUALLY CHORDAL GRAPHS
- 4. K.V. Rudakov, "Completeness and universal constraints in the problem of correction of heuristic classification algorithms," Kibernetika, No, 3, 106-109 (1987).
- Journal of Geometry Vol. 50 (1994)
- Article No. 10.1006/eujc.1999.0381 Available online at http://www.idealibrary.com on
- Pareto Envelopes in R 3 under l 1 and l # Distance Functions #
- Journal of Geometry Vol. 56 (1996)
- arXiv:1107.1359v1[cs.CG]7Jul2011 Bidirected minimum Manhattan network problem
- arXiv:1107.1207v1[math.CO]6Jul2011 Nice labeling problem for event structures: a counterexample
- Retracts of products of chordal graphs B. Bresar1, J. Chalopin2, V. Chepoi2, M. Kovse1, A. Labourel2, and Y. Vax`es2
- arXiv:1107.0863v1[math.CO]5Jul2011 On embeddings of CAT(0) cube complexes into products of trees
- Planar Hop Spanners for Unit Disk Graphs Nicolas Catusse, Victor Chepoi, and Yann Vax`es
