![]() | ![]() |
| 2012 | ||
|---|---|---|
| 83 | Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès: A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62(1-2): 146-168 (2012) | |
| 82 | Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang: Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62(3-4): 713-732 (2012) | |
| 81 | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès: Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) | |
| 80 | Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès: Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discrete & Computational Geometry 47(1): 187-214 (2012) | |
| 2011 | ||
| 79 | Victor Chepoi, Morgan Seston: Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. Algorithmica 59(4): 521-568 (2011) | |
| 78 | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès: Bidirected minimum Manhattan network problem CoRR abs/1107.1359: (2011) | |
| 77 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès: Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discrete Math. 25(1): 333-359 (2011) | |
| 76 | Nicolas Catusse, Victor Chepoi, Yann Vaxès: Embedding into the rectilinear plane in optimal O(n2) time. Theor. Comput. Sci. 412(22): 2425-2433 (2011) | |
| 2010 | ||
| 75 | Nicolas Catusse, Victor Chepoi, Yann Vaxès: Planar Hop Spanners for Unit Disk Graphs. ALGOSENSORS 2010: 16-30 | |
| 74 | Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès: Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM 2010: 95-109 | |
| 73 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès: Cop and robber games when the robber can hide and ride CoRR abs/1001.4457: (2010) | |
| 72 | Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès: Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs CoRR abs/1007.0489: (2010) | |
| 71 | Victor Chepoi, Daniela Maftuleac: Shortest path problem in rectangular complexes of global nonpositive curvature CoRR abs/1010.0852: (2010) | |
| 70 | Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31(2): 502-516 (2010) | |
| 69 | Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès: Pareto Envelopes in Simple Polygons. Int. J. Comput. Geometry Appl. 20(6): 707-721 (2010) | |
| 68 | Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein: Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discrete Math. 24(4): 1399-1440 (2010) | |
| 2009 | ||
| 67 | Victor Chepoi, Morgan Seston: An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. STACS 2009: 265-276 | |
| 66 | Victor Chepoi, Morgan Seston: An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances CoRR abs/0902.1261: (2009) | |
| 65 | Nicolas Catusse, Victor Chepoi, Yann Vaxès: Embedding into the rectilinear plane in optimal O*(n^2) CoRR abs/0910.1059: (2009) | |
| 64 | Victor Chepoi, Bernard Fichet, Morgan Seston: Seriation in the Presence of Errors: NP-Hardness of l INFINITY -Fitting Robinson Structures to Dissimilarity Matrices. J. Classification 26(3): 279-296 (2009) | |
| 2008 | ||
| 63 | Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105 | |
| 62 | 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 | |
| 61 | 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) | |
| 60 | Hans-Jürgen Bandelt, Victor Chepoi: The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. Eur. J. Comb. 29(3): 676-700 (2008) | |
| 59 | Victor Chepoi, Karim Nouioua, Yann Vaxès: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008) | |
| 58 | 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 | ||
| 57 | Victor Chepoi, Bertrand Estellon: Packing and Covering delta -Hyperbolic Spaces by Balls. APPROX-RANDOM 2007: 59-73 | |
| 56 | 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 | |
| 55 | Victor Chepoi, Karim Nouioua: Pareto envelopes in R3 under l1 and linfinity distance functions. Symposium on Computational Geometry 2007: 284-293 | |
| 54 | Victor Chepoi, Bertrand Estellon, Yann Vaxès: Covering Planar Graphs with a Fixed Number of Balls. Discrete & Computational Geometry 37(2): 237-244 (2007) | |
| 53 | Hans-Jürgen Bandelt, Victor Chepoi: The algebra of metric betweenness I: Subdirect representation and retraction. Eur. J. Comb. 28(6): 1640-1661 (2007) | |
| 52 | Victor Chepoi: Basis graphs of even Delta-matroids. J. Comb. Theory, Ser. B 97(2): 175-192 (2007) | |
| 2006 | ||
| 51 | 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) | |
| 50 | Hans-Jürgen Bandelt, Victor Chepoi, Andreas W. M. Dress, Jack H. Koolen: Combinatorics of lopsided sets. Eur. J. Comb. 27(5): 669-689 (2006) | |
| 49 | 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) | |
| 48 | 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 | ||
| 47 | Victor Chepoi, Karim Nouioua, Yann Vaxès: A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51 | |
| 46 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387 | |
| 45 | Victor Chepoi, Bertrand Estellon, Yann Vaxès: Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS 2005: 282-293 | |
| 44 | 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) | |
| 43 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan: Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347(1-2): 54-75 (2005) | |
| 2004 | ||
| 42 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004 | |
| 41 | Victor Chepoi, Clémentine Fanciullini, Yann Vaxès: Median problem in some plane triangulations and quadrangulations. Comput. Geom. 27(3): 193-210 (2004) | |
| 2003 | ||
| 40 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan: Additive Spanners for k-Chordal Graphs. CIAC 2003: 96-107 | |
| 39 | Victor Chepoi, Feodor F. Dragan: Finding a central vertex in an HHD-free graph. Discrete Applied Mathematics 131(1): 93-11 (2003) | |
| 38 | Victor Chepoi, Hartmut Noltemeier, Yann Vaxès: Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) | |
| 37 | Hans-Jürgen Bandelt, Victor Chepoi: 1-Hyperbolic Graphs. SIAM J. Discrete Math. 16(2): 323-334 (2003) | |
| 36 | Victor Chepoi, Alexis Rollin: Interval routing in some planar networks. Theor. Comput. Sci. 290(3): 1503-1540 (2003) | |
| 2002 | ||
| 35 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355 | |
| 34 | Victor Chepoi, Yann Vaxès: Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2): 243-262 (2002) | |
| 33 | Hans-Jürgen Bandelt, Victor Chepoi: Graphs with Connected Medians. SIAM J. Discrete Math. 15(2): 268-282 (2002) | |
| 2001 | ||
| 32 | Victor Chepoi, Alexis Rollin: Interval Routing in Some Planar Quadrangulations. SIROCCO 2001: 89-104 | |
| 2000 | ||
| 31 | Hans-Jürgen Bandelt, Victor Chepoi: Decomposition andl1-Embedding of Weakly Median Graphs. Eur. J. Comb. 21(6): 701-714 (2000) | |
| 30 | Hans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov: A Characterization of Minimizable Metrics in the Multifacility Location Problem. Eur. J. Comb. 21(6): 715-725 (2000) | |
| 29 | Victor Chepoi, Feodor F. Dragan: A Note on Distance Approximating Trees in Graphs. Eur. J. Comb. 21(6): 761-766 (2000) | |
| 1999 | ||
| 28 | Victor Chepoi, Bernard Fichet: Three-way Metrics: Axiomatization and Properties. Electronic Notes in Discrete Mathematics 2: 150 (1999) | |
| 27 | Victor Chepoi, Feodor F. Dragan: A note on distance approximating trees in graphs. Electronic Notes in Discrete Mathematics 3: 39 (1999) | |
| 26 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999) | |
| 1998 | ||
| 25 | Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent: Embedding into Rectilinear Spaces. Discrete & Computational Geometry 19(4): 595-604 (1998) | |
| 24 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discrete Applied Mathematics 82(1-3): 43-77 (1998) | |
| 23 | Victor Chepoi: A note on r-dominating cliques. Discrete Mathematics 183(1-3): 47-60 (1998) | |
| 22 | Victor Chepoi, Sandi Klavzar: Distances in benzenoid systems: Further developments. Discrete Mathematics 192(1-3): 27-39 (1998) | |
| 21 | Hans-Jürgen Bandelt, Victor Chepoi: Embedding into the rectilinear grid. Networks 32(2): 127-132 (1998) | |
| 20 | Victor Chepoi: On Distance-Preserving and Domination Elimination Orderings. SIAM J. Discrete Math. 11(3): 414-436 (1998) | |
| 19 | Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. SIAM J. Discrete Math. 11(3): 437-455 (1998) | |
| 1997 | ||
| 18 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91 | |
| 17 | Victor Chepoi: Peakless Functions on Graphs. Discrete Applied Mathematics 73(2): 175-189 (1997) | |
| 16 | Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin: Clin D'oeil on L1-embeddable Planar Graphs. Discrete Applied Mathematics 80(1): 3-19 (1997) | |
| 15 | Victor Chepoi: Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof. J. Comb. Theory, Ser. B 69(1): 97-100 (1997) | |
| 14 | Victor Chepoi, Sandi Klavzar: The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. Journal of Chemical Information and Computer Sciences 37(4): 752-755 (1997) | |
| 13 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discrete Math. 10(1): 109-127 (1997) | |
| 1996 | ||
| 12 | Hans-Jürgen Bandelt, Victor Chepoi: Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. Discrete & Computational Geometry 15(1): 107-117 (1996) | |
| 11 | Victor Chepoi: A Multifacility Location Problem on Median Spaces. Discrete Applied Mathematics 64(1): 1-29 (1996) | |
| 10 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics 158(1-3): 273-278 (1996) | |
| 9 | Hans-Jürgen Bandelt, Victor Chepoi: A Helly theorem in weakly modular space. Discrete Mathematics 160(1-3): 25-39 (1996) | |
| 8 | Hans-Jürgen Bandelt, Victor Chepoi: Graphs of Acyclic Cubical Complexes. Eur. J. Comb. 17(2-3): 113-120 (1996) | |
| 7 | Hans-Jürgen Bandelt, Victor Chepoi: Cellular Bipartite Graphs. Eur. J. Comb. 17(2-3): 121-134 (1996) | |
| 6 | Victor Chepoi: On Distances in Benzenoid Systems. Journal of Chemical Information and Computer Sciences 36(6): 1169-1172 (1996) | |
| 1995 | ||
| 5 | Victor Chepoi, Feodor F. Dragan: On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). FCT 1995: 181-190 | |
| 1994 | ||
| 4 | Victor Chepoi, Feodor F. Dragan: A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA 1994: 159-170 | |
| 3 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80 | |
| 2 | Victor Chepoi, Feodor F. Dragan: Computing a Median Point of a Simple Rectilinear Polygon. Inf. Process. Lett. 49(6): 281-285 (1994) | |
| 1993 | ||
| 1 | Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. WG 1993: 237-251 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page