
Distance labeling schemes for K_4free bridged graphs
kApproximate distance labeling schemes are schemes that label the verti...
read it

Ample completions of OMs and CUOMs
This paper considers completions of COMs (complexes oriented matroids) t...
read it

Medians in median graphs in linear time
The median of a graph G is the set of all vertices x of G minimizing the...
read it

Twodimensional partial cubes
We investigate the structure of twodimensional partial cubes, i.e., of ...
read it

Unlabeled sample compression schemes and corner peelings for ample and maximum classes
We examine connections between combinatorial notions that arise in machi...
read it

1Safe Petri nets and special cube complexes: equivalence and applications
Nielsen, Plotkin, and Winskel (1981) proved that every 1safe Petri net ...
read it

Distance and routing labeling schemes for cubefree median graphs
Distance labeling schemes are schemes that label the vertices of a graph...
read it

Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all...
read it

Fast approximation and exact computation of negative curvature parameters of graphs
In this paper, we study Gromov hyperbolicity and related parameters, tha...
read it

On density of subgraphs of Cartesian products
In this paper, we extend two classical results about the density of subg...
read it

On density of subgraphs of halved cubes
Let S be a family of subsets of a set X of cardinality m and VCdim( S)...
read it
Victor Chepoi
is this you? claim profile