On link diameter of a simple rectilinear polygon. - Victor Chepoi; Feodor F. Dragan (Comput. Sci. J. Moldova, 1993)

A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. - Victor Chepoi; Feodor F. Dragan (ESA, 1994)

Computing a Median Point of a Simple Rectilinear Polygon. - Victor Chepoi; Feodor F. Dragan (Inf. Process. Lett., 1994)

On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). - Victor Chepoi; Feodor F. Dragan (FCT, 1995)

A Multifacility Location Problem on Median Spaces. - Victor Chepoi (Discret. Appl. Math., 1996)

Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. - Hans-Jürgen Bandelt; Victor Chepoi (Discret. Comput. Geom., 1996)

A Helly theorem in weakly modular space. - Hans-Jürgen Bandelt; Victor Chepoi (Discret. Math., 1996)

Perfect elimination orderings of chordal powers of graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (Discret. Math., 1996)

Graphs of Acyclic Cubical Complexes. - Hans-Jürgen Bandelt; Victor Chepoi (Eur. J. Comb., 1996)

Cellular Bipartite Graphs. - Hans-Jürgen Bandelt; Victor Chepoi (Eur. J. Comb., 1996)

On Distances in Benzenoid Systems. - Victor Chepoi (J. Chem. Inf. Comput. Sci., 1996)

Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (ESA, 1997)

Peakless Functions on Graphs. - Victor Chepoi (Discret. Appl. Math., 1997)

Clin D'oeil on L1-embeddable Planar Graphs. - Victor Chepoi; Michel Deza; Viatcheslav P. Grishukhin (Discret. Appl. Math., 1997)

The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. - Victor Chepoi; Sandi Klavzar (J. Chem. Inf. Comput. Sci., 1997)

Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof. - Victor Chepoi (J. Comb. Theory B, 1997)

Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (SIAM J. Discret. Math., 1997)

The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (Discret. Appl. Math., 1998)

Embedding into Rectilinear Spaces. - Hans-Jürgen Bandelt; Victor Chepoi; Monique Laurent (Discret. Comput. Geom., 1998)

A note on r-dominating cliques. - Victor Chepoi (Discret. Math., 1998)

Distances in benzenoid systems: Further developments. - Victor Chepoi; Sandi Klavzar (Discret. Math., 1998)

Embedding into the rectilinear grid. - Hans-Jürgen Bandelt; Victor Chepoi (Networks, 1998)

Dually Chordal Graphs. - Andreas Brandstädt; Feodor F. Dragan; Victor Chepoi; Vitaly I. Voloshin (SIAM J. Discret. Math., 1998)

On Distance-Preserving and Domination Elimination Orderings. - Victor Chepoi (SIAM J. Discret. Math., 1998)

A note on distance approximating trees in graphs. - Victor Chepoi; Feodor F. Dragan (Electron. Notes Discret. Math., 1999)

Three-way Metrics: Axiomatization and Properties. - Victor Chepoi; Bernard Fichet (Electron. Notes Discret. Math., 1999)

Fuzzy clustering with structural constraints. - Victor Chepoi; Dan Dumitrescu (Fuzzy Sets Syst., 1999)

Distance Approximating Trees for Chordal and Dually Chordal Graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (J. Algorithms, 1999)

Graphs of Some CAT(0) Complexes. - Victor Chepoi (Adv. Appl. Math., 2000)

Decomposition andl1-Embedding of Weakly Median Graphs. - Hans-Jürgen Bandelt; Victor Chepoi (Eur. J. Comb., 2000)

A Characterization of Minimizable Metrics in the Multifacility Location Problem. - Hans-Jürgen Bandelt; Victor Chepoi; Alexander V. Karzanov (Eur. J. Comb., 2000)

Interval Routing in Some Planar Quadrangulations. - Victor Chepoi; Alexis Rollin (SIROCCO, 2001)

Center and diameter problems in plane triangulations and quadrangulations. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2002)

Augmenting Trees to Meet Biconnectivity and Diameter Constraints. - Victor Chepoi; Yann Vaxès (Algorithmica, 2002)

Graphs with Connected Medians. - Hans-Jürgen Bandelt; Victor Chepoi (SIAM J. Discret. Math., 2002)

Additive Spanners for k-Chordal Graphs. - Victor Chepoi; Feodor F. Dragan; Chenyu Yan (CIAC, 2003)

Finding a central vertex in an HHD-free graph. - Victor Chepoi; Feodor F. Dragan (Discret. Appl. Math., 2003)

On covering bridged plane triangulations with balls. - Victor Chepoi; Yann Vaxès (J. Graph Theory, 2003)

Upgrading trees under diameter and budget constraints. - Victor Chepoi; Hartmut Noltemeier; Yann Vaxès (Networks, 2003)

1-Hyperbolic Graphs. - Hans-Jürgen Bandelt; Victor Chepoi (SIAM J. Discret. Math., 2003)

Interval routing in some planar networks. - Victor Chepoi; Alexis Rollin (Theor. Comput. Sci., 2003)

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (IPDPS, 2004)

Median problem in some plane triangulations and quadrangulations. - Victor Chepoi; Clémentine Fanciullini; Yann Vaxès (Comput. Geom., 2004)

Distance-Based Location Update and Routing in Irregular Cellular Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SNPD, 2005)

Additive sparse spanners for graphs with bounded length of largest induced cycle. - Victor Chepoi; Feodor F. Dragan; Chenyu Yan (Theor. Comput. Sci., 2005)

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. - Victor Chepoi; Bertrand Estellon; Karim Nouioua; Yann Vaxès (Algorithmica, 2006)

Combinatorics of lopsided sets. - Hans-Jürgen Bandelt; Victor Chepoi; Andreas W. M. Dress; Jack H. Koolen (Eur. J. Comb., 2006)

Distance and routing labeling schemes for non-positively curved plane graphs. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (J. Algorithms, 2006)

Addressing, distances and routing in triangular systems with applications in cellular networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (Wirel. Networks, 2006)

Packing and Covering delta -Hyperbolic Spaces by Balls. - Victor Chepoi; Bertrand Estellon (APPROX-RANDOM, 2007)

Pareto envelopes in R3 under l1 and linfinity distance functions. - Victor Chepoi; Karim Nouioua (SCG, 2007)

Covering Planar Graphs with a Fixed Number of Balls. - Victor Chepoi; Bertrand Estellon; Yann Vaxès (Discret. Comput. Geom., 2007)

The algebra of metric betweenness I: Subdirect representation and retraction. - Hans-Jürgen Bandelt; Victor Chepoi (Eur. J. Comb., 2007)

Basis graphs of even Delta-matroids. - Victor Chepoi (J. Comb. Theory B, 2007)

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (SCG, 2008)

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (ISMVL, 2008)

The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. - Hans-Jürgen Bandelt; Victor Chepoi (Eur. J. Comb., 2008)

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (Electron. Notes Discret. Math., 2008)

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. - Victor Chepoi; Bertrand Estellon; Yann Vaxès (Theor. Comput. Sci., 2008)

A rounding algorithm for approximating minimum Manhattan networks. - Victor Chepoi; Karim Nouioua; Yann Vaxès (Theor. Comput. Sci., 2008)

An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. - Victor Chepoi; Morgan Seston (STACS, 2009)

Seriation in the Presence of Errors: NP-Hardness of l∞-Fitting Robinson Structures to Dissimilarity Matrices. - Victor Chepoi; Bernard Fichet; Morgan Seston (J. Classif., 2009)

An Approximation Algorithm for l infty-Fitting Robinson Structures to Distances - Victor Chepoi; Morgan Seston (CoRR, 2009)

Embedding into the rectilinear plane in optimal O*(n^2) - Nicolas Catusse; Victor Chepoi; Yann Vaxès (CoRR, 2009)

Planar Hop Spanners for Unit Disk Graphs. - Nicolas Catusse; Victor Chepoi; Yann Vaxès (ALGOSENSORS, 2010)

The Helly property and satisfiability of Boolean formulas defined on set families. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (Eur. J. Comb., 2010)

Pareto Envelopes in Simple Polygons. - Victor Chepoi; Karim Nouioua; Edouard Thiel; Yann Vaxès (Int. J. Comput. Geom. Appl., 2010)

Combinatorics and Geometry of Finite and Infinite Squaregraphs. - Hans-Jürgen Bandelt; Victor Chepoi; David Eppstein (SIAM J. Discret. Math., 2010)

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. - Victor Chepoi; Morgan Seston (Algorithmica, 2011)

Cop and Robber Games When the Robber Can Hide and Ride. - Jérémie Chalopin; Victor Chepoi; Nicolas Nisse; Yann Vaxès (SIAM J. Discret. Math., 2011)

Embedding into the rectilinear plane in optimal O(n2) time. - Nicolas Catusse; Victor Chepoi; Yann Vaxès (Theor. Comput. Sci., 2011)

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. - Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès (Algorithmica, 2012)

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès; Yang Xiang (Algorithmica, 2012)

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. - Victor Chepoi; Tristan Fevat; Emmanuel Godard; Yann Vaxès (Algorithmica, 2012)

Proof of two Maurer's conjectures on basis graphs of matroids - Jérémie Chalopin; Victor Chepoi; Damian Osajda (CoRR, 2012)

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. - Victor Chepoi; Feodor F. Dragan; Ilan Newman; Yuri Rabinovich; Yann Vaxès (Discret. Comput. Geom., 2012)

Nice Labeling Problem for Event Structures: A Counterexample. - Victor Chepoi (SIAM J. Comput., 2012)

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. - Victor Chepoi; Stefan Felsner (Comput. Geom., 2013)

Shortest path problem in rectangular complexes of global nonpositive curvature. - Victor Chepoi; Daniela Maftuleac (Comput. Geom., 2013)

On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes. - Victor Chepoi; Mark F. Hagen (J. Comb. Theory B, 2013)

Retracts of Products of Chordal Graphs. - Bostjan Bresar; Jérémie Chalopin; Victor Chepoi; Matjaz Kovse; Arnaud Labourel; Yann Vaxès (J. Graph Theory, 2013)

Cop and Robber Game and Hyperbolicity. - Jérémie Chalopin; Victor Chepoi; Panos Papasoglu; Timothée Pecatte (SIAM J. Discret. Math., 2014)

Ramified Rectilinear Polygons: Coordinatization by Dendrons. - Hans-Jürgen Bandelt; Victor Chepoi; David Eppstein (Discret. Comput. Geom., 2015)

Isometric Embedding of Busemann Surfaces into L1. - Jérémie Chalopin; Victor Chepoi; Guyslain Naves (Discret. Comput. Geom., 2015)

On two conjectures of Maurer concerning basis graphs of matroids. - Jérémie Chalopin; Victor Chepoi; Damian Osajda (J. Comb. Theory B, 2015)

A counterexample to Thiagarajan's conjecture. - Jérémie Chalopin; Victor Chepoi (CoRR, 2016)

Partial cubes without $Q_3^-$ minors. - Victor Chepoi; Kolja Knauer; Tilen Marc (CoRR, 2016)

Core congestion is inherent in hyperbolic networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2017)

Distance-Preserving Subgraphs of Johnson Graphs. - Victor Chepoi (Comb., 2017)

Packing and Covering with Balls on Busemann Surfaces. - Victor Chepoi; Bertrand Estellon; Guyslain Naves (Discret. Comput. Geom., 2017)

Bidirected minimum Manhattan network problem. - Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès (Networks, 2017)

Fast Approximation of Centrality and Distances in Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (COCOA, 2018)

COMs: Complexes of oriented matroids. - Hans-Jürgen Bandelt; Victor Chepoi; Kolja Knauer (J. Comb. Theory A, 2018)

Distance Labeling Schemes for Cube-Free Median Graphs. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (MFCS, 2019)

Medians in median graphs in linear time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2019)

On density of subgraphs of halved cubes. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (Eur. J. Comb., 2019)

Fast approximation of eccentricities and distances in hyperbolic graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (J. Graph Algorithms Appl., 2019)

1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. - Jérémie Chalopin; Victor Chepoi (ACM Trans. Comput. Log., 2019)

Distance Labeling Schemes for K4-Free Bridged Graphs. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (SIROCCO, 2020)

Two-Dimensional Partial Cubes. - Victor Chepoi; Kolja Knauer; Manon Philibert (Electron. J. Comb., 2020)

Ample completions of OMs and CUOMs. - Victor Chepoi; Kolja Knauer; Manon Philibert (CoRR, 2020)

Hypercellular graphs: Partial cubes without Q3- as partial cube minor. - Victor Chepoi; Kolja Knauer; Tilen Marc (Discret. Math., 2020)

A counterexample to Thiagarajan's conjecture on regular event structures. - Jérémie Chalopin; Victor Chepoi (J. Comput. Syst. Sci., 2020)

On density of subgraphs of Cartesian products. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (J. Graph Theory, 2020)

Distance and Routing Labeling Schemes for Cube-Free Median Graphs. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (Algorithmica, 2021)

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Abdulhakeem Mohammed; Yann Vaxès (Discret. Comput. Geom., 2021)

Graphs with convex balls. - Jérémie Chalopin; Victor Chepoi; Ugo Giocanti (CoRR, 2022)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2022)

Distance labeling schemes for K4-free bridged graphs. - Victor Chepoi; Arnaud Labourel; Sébastien Ratel (Inf. Comput., 2022)

Medians in median graphs and their cube complexes in linear time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (J. Comput. Syst. Sci., 2022)

Unlabeled sample compression schemes and corner peelings for ample and maximum classes. - Jérémie Chalopin; Victor Chepoi; Shay Moran; Manfred K. Warmuth (J. Comput. Syst. Sci., 2022)

Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. - Victor Chepoi; Kolja Knauer; Manon Philibert (SIAM J. Discret. Math., 2022)

Boundary rigidity of finite CAT(0) cube complexes. - Jérémie Chalopin; Victor Chepoi (CoRR, 2023)

A Simple and Optimal Algorithm for Strict Circular Seriation. - Mikhael Carmona; Victor Chepoi; Guyslain Naves; Pascal Préa (SIAM J. Math. Data Sci., 2023)

Sample Compression Schemes for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel; Yann Vaxès (SIAM J. Discret. Math., 2023)

Non-Clashing Teaching Maps for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel (COLT, 2024)

Separation axiom S3 for geodesic convexity in graphs. - Victor Chepoi (CoRR, 2024)

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Discret. Appl. Math., 2024)

Labeled sample compression schemes for complexes of oriented matroids. - Victor Chepoi; Kolja Knauer; Manon Philibert (J. Comput. Syst. Sci., 2024)

Boundary rigidity of CAT(0) cube complexes. - Jérémie Chalopin; Victor Chepoi (J. Comb. Theory B, 2024)

First-order logic axiomatization of metric graph theory. - Jérémie Chalopin; Manoj Changat; Victor Chepoi; Jeny Jacob (Theor. Comput. Sci., 2024)

Graphs with Gp-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Math. Program., 2024)

Modules in Robinson Spaces. - Mikhael Carmona; Victor Chepoi; Guyslain Naves; Pascal Préa (SIAM J. Discret. Math., 2024)

Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities. - Mikhael Carmona; Victor Chepoi; Guyslain Naves; Pascal Préa (J. Classif., 2024)

Modules and PQ-trees in Robinson spaces. - Mikhael Carmona; Victor Chepoi; Guyslain Naves; Pascal Préa (Inf. Comput., 2025)

On Gp-unimodality of radius functions in graphs: structure and algorithms. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Yann Vaxès (CoRR, 2025)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs. - Marco Bressan 002; Victor Chepoi; Emmanuel Esposito; Maximilian Thiessen (CoRR, 2025)