Victor Chepoi

Orcid: 0000-0002-0481-7312

According to our database1, Victor Chepoi authored at least 124 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modules in Robinson Spaces.
SIAM J. Discret. Math., March, 2024

Graphs with G<sup>p</sup>-connected medians.
Math. Program., January, 2024

First-order logic axiomatization of metric graph theory.
Theor. Comput. Sci., 2024

Boundary rigidity of CAT(0) cube complexes.
J. Comb. Theory B, 2024

Labeled sample compression schemes for complexes of oriented matroids.
J. Comput. Syst. Sci., 2024

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.
Discret. Appl. Math., 2024

Separation axiom S<sub>3</sub> for geodesic convexity in graphs.
CoRR, 2024

Non-Clashing Teaching Maps for Balls in Graphs.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Sample Compression Schemes for Balls in Graphs.
SIAM J. Discret. Math., December, 2023

A Simple and Optimal Algorithm for Strict Circular Seriation.
SIAM J. Math. Data Sci., March, 2023

Boundary rigidity of finite CAT(0) cube complexes.
CoRR, 2023

Modules and PQ-trees in Robinson spaces.
CoRR, 2023

2022
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids.
SIAM J. Discret. Math., 2022

Unlabeled sample compression schemes and corner peelings for ample and maximum classes.
J. Comput. Syst. Sci., 2022

Medians in median graphs and their cube complexes in linear time.
J. Comput. Syst. Sci., 2022

Distance labeling schemes for <i>K</i><sub>4</sub>-free bridged graphs.
Inf. Comput., 2022

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G<sup>2</sup>-connected medians.
CoRR, 2022

Graphs with convex balls.
CoRR, 2022

2021
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.
Discret. Comput. Geom., 2021

Distance and Routing Labeling Schemes for Cube-Free Median Graphs.
Algorithmica, 2021

2020
On density of subgraphs of Cartesian products.
J. Graph Theory, 2020

A counterexample to Thiagarajan's conjecture on regular event structures.
J. Comput. Syst. Sci., 2020

Hypercellular graphs: Partial cubes without Q3- as partial cube minor.
Discret. Math., 2020

Ample completions of OMs and CUOMs.
CoRR, 2020

Two-Dimensional Partial Cubes.
Electron. J. Comb., 2020

Distance Labeling Schemes for K<sub>4</sub>-Free Bridged Graphs.
Proceedings of the Structural Information and Communication Complexity, 2020

2019
1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications.
ACM Trans. Comput. Log., 2019

Fast approximation of eccentricities and distances in hyperbolic graphs.
J. Graph Algorithms Appl., 2019

On density of subgraphs of halved cubes.
Eur. J. Comb., 2019

Medians in median graphs in linear time.
CoRR, 2019

Distance Labeling Schemes for Cube-Free Median Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
COMs: Complexes of oriented matroids.
J. Comb. Theory A, 2018

Fast Approximation of Centrality and Distances in Hyperbolic Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Bidirected minimum Manhattan network problem.
Networks, 2017

Packing and Covering with Balls on Busemann Surfaces.
Discret. Comput. Geom., 2017

Distance-Preserving Subgraphs of Johnson Graphs.
Comb., 2017

Core congestion is inherent in hyperbolic networks.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Partial cubes without $Q_3^-$ minors.
CoRR, 2016

A counterexample to Thiagarajan's conjecture.
CoRR, 2016

2015
On two conjectures of Maurer concerning basis graphs of matroids.
J. Comb. Theory B, 2015

Isometric Embedding of Busemann Surfaces into L<sub>1</sub>.
Discret. Comput. Geom., 2015

Ramified Rectilinear Polygons: Coordinatization by Dendrons.
Discret. Comput. Geom., 2015

2014
Cop and Robber Game and Hyperbolicity.
SIAM J. Discret. Math., 2014

2013
Retracts of Products of Chordal Graphs.
J. Graph Theory, 2013

On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes.
J. Comb. Theory B, 2013

Shortest path problem in rectangular complexes of global nonpositive curvature.
Comput. Geom., 2013

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve.
Comput. Geom., 2013

2012
Nice Labeling Problem for Event Structures: A Counterexample.
SIAM J. Comput., 2012

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.
Discret. Comput. Geom., 2012

Proof of two Maurer's conjectures on basis graphs of matroids
CoRR, 2012

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.
Algorithmica, 2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.
Algorithmica, 2012

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.
Algorithmica, 2012

2011
Embedding into the rectilinear plane in optimal O(n<sup>2</sup>) time.
Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.
SIAM J. Discret. Math., 2011

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for <i>l</i><sub>∞</sub>-Fitting Robinson Structures to Distances.
Algorithmica, 2011

2010
Combinatorics and Geometry of Finite and Infinite Squaregraphs.
SIAM J. Discret. Math., 2010

Pareto Envelopes in Simple Polygons.
Int. J. Comput. Geom. Appl., 2010

The Helly property and satisfiability of Boolean formulas defined on set families.
Eur. J. Comb., 2010

Planar Hop Spanners for Unit Disk Graphs.
Proceedings of the Algorithms for Sensor Systems, 2010

2009
Embedding into the rectilinear plane in optimal O*(n^2)
CoRR, 2009

An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances
CoRR, 2009

Seriation in the Presence of Errors: NP-Hardness of <i>l</i><sub><i>∞</i></sub>-Fitting Robinson Structures to Dissimilarity Matrices.
J. Classif., 2009

An Approximation Algorithm for l<sub>infinity</sub> Fitting Robinson Structures to Distances.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
A rounding algorithm for approximating minimum Manhattan networks.
Theor. Comput. Sci., 2008

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.
Theor. Comput. Sci., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.
Electron. Notes Discret. Math., 2008

The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs.
Eur. J. Comb., 2008

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Basis graphs of even Delta-matroids.
J. Comb. Theory B, 2007

The algebra of metric betweenness I: Subdirect representation and retraction.
Eur. J. Comb., 2007

Covering Planar Graphs with a Fixed Number of Balls.
Discret. Comput. Geom., 2007

Pareto envelopes in R<sup>3</sup> under l<sub>1</sub> and l<sub>infinity</sub> distance functions.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Packing and Covering <i>delta</i> -Hyperbolic Spaces by Balls.
Proceedings of the Approximation, 2007

2006
Addressing, distances and routing in triangular systems with applications in cellular networks.
Wirel. Networks, 2006

Distance and routing labeling schemes for non-positively curved plane graphs.
J. Algorithms, 2006

Combinatorics of lopsided sets.
Eur. J. Comb., 2006

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.
Algorithmica, 2006

2005
Additive sparse spanners for graphs with bounded length of largest induced cycle.
Theor. Comput. Sci., 2005

Distance-Based Location Update and Routing in Irregular Cellular Networks.
Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

2004
Median problem in some plane triangulations and quadrangulations.
Comput. Geom., 2004

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Interval routing in some planar networks.
Theor. Comput. Sci., 2003

1-Hyperbolic Graphs.
SIAM J. Discret. Math., 2003

Upgrading trees under diameter and budget constraints.
Networks, 2003

On covering bridged plane triangulations with balls.
J. Graph Theory, 2003

Finding a central vertex in an HHD-free graph.
Discret. Appl. Math., 2003

Additive Spanners for k-Chordal Graphs.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Graphs with Connected Medians.
SIAM J. Discret. Math., 2002

Augmenting Trees to Meet Biconnectivity and Diameter Constraints.
Algorithmica, 2002

Center and diameter problems in plane triangulations and quadrangulations.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Interval Routing in Some Planar Quadrangulations.
Proceedings of the SIROCCO 8, 2001

2000
A Characterization of Minimizable Metrics in the Multifacility Location Problem.
Eur. J. Comb., 2000

Decomposition and<i>l</i><sub>1</sub>-Embedding of Weakly Median Graphs.
Eur. J. Comb., 2000

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

1999
Distance Approximating Trees for Chordal and Dually Chordal Graphs.
J. Algorithms, 1999

Fuzzy clustering with structural constraints.
Fuzzy Sets Syst., 1999

Three-way Metrics: Axiomatization and Properties.
Electron. Notes Discret. Math., 1999

A note on distance approximating trees in graphs.
Electron. Notes Discret. Math., 1999

1998
On Distance-Preserving and Domination Elimination Orderings.
SIAM J. Discret. Math., 1998

Dually Chordal Graphs.
SIAM J. Discret. Math., 1998

Embedding into the rectilinear grid.
Networks, 1998

Distances in benzenoid systems: Further developments.
Discret. Math., 1998

A note on r-dominating cliques.
Discret. Math., 1998

Embedding into Rectilinear Spaces.
Discret. Comput. Geom., 1998

The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.
Discret. Appl. Math., 1998

1997
Clique <i>r</i>-Domination and Clique <i>r</i>-Packing Problems on Dually Chordal Graphs.
SIAM J. Discret. Math., 1997

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

The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time.
J. Chem. Inf. Comput. Sci., 1997

Clin D'oeil on L<sub>1</sub>-embeddable Planar Graphs.
Discret. Appl. Math., 1997

Peakless Functions on Graphs.
Discret. Appl. Math., 1997

Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract).
Proceedings of the Algorithms, 1997

1996
On Distances in Benzenoid Systems.
J. Chem. Inf. Comput. Sci., 1996

Cellular Bipartite Graphs.
Eur. J. Comb., 1996

Graphs of Acyclic Cubical Complexes.
Eur. J. Comb., 1996

Perfect elimination orderings of chordal powers of graphs.
Discret. Math., 1996

A Helly theorem in weakly modular space.
Discret. Math., 1996

Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion.
Discret. Comput. Geom., 1996

A Multifacility Location Problem on Median Spaces.
Discret. Appl. Math., 1996

1995
On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
Computing a Median Point of a Simple Rectilinear Polygon.
Inf. Process. Lett., 1994

A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.
Proceedings of the Algorithms, 1994

1993
On link diameter of a simple rectilinear polygon.
Comput. Sci. J. Moldova, 1993


  Loading...