research
∙
09/06/2023
Non-Clashing Teaching Maps for Balls in Graphs
Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] in...
share
research
∙
06/15/2023
Modules and PQ-trees in Robinson spaces
A Robinson space is a dissimilarity space (X,d) on n points for which th...
research
∙
06/27/2022
Sample compression schemes for balls in graphs
One of the open problems in machine learning is whether any set-family o...
research
∙
06/07/2022
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G^2-connected medians
The median function is a location/consensus function that maps any profi...
research
∙
05/10/2022
A simple and optimal algorithm for strict circular seriation
Recently, Armstrong, Guzmán, and Sing Long (2021), presented an optimal ...
research
∙
03/23/2022
Modules in Robinson Spaces
A Robinson space is a dissimilarity space (X,d) (i.e., a set X of size n...
research
∙
03/02/2022
First-order logic axiomatization of metric graph theory
The main goal of this note is to provide a First-Order Logic with Betwee...
research
∙
01/28/2022
Graphs with G^p-connected medians
The median of a graph G with weighted vertices is the set of all vertice...
research
∙
01/05/2022
Graphs with convex balls
In this paper, we investigate the graphs in which all balls are convex a...
research
∙
10/28/2021
Labeled sample compression schemes for complexes of oriented matroids
We show that the topes of a complex of oriented matroids (abbreviated CO...
research
∙
07/28/2020
Distance labeling schemes for K_4-free bridged graphs
k-Approximate distance labeling schemes are schemes that label the verti...
research
∙
07/24/2020
Ample completions of OMs and CUOMs
This paper considers completions of COMs (complexes oriented matroids) t...
research
∙
07/24/2019
Medians in median graphs in linear time
The median of a graph G is the set of all vertices x of G minimizing the...
research
∙
06/11/2019
Two-dimensional partial cubes
We investigate the structure of two-dimensional partial cubes, i.e., of ...
research
∙
12/05/2018
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
We examine connections between combinatorial notions that arise in machi...
research
∙
10/08/2018
1-Safe Petri nets and special cube complexes: equivalence and applications
Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net ...
research
∙
09/27/2018
Distance and routing labeling schemes for cube-free median graphs
Distance labeling schemes are schemes that label the vertices of a graph...
research
∙
05/17/2018
Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all...
research
∙
03/16/2018
Fast approximation and exact computation of negative curvature parameters of graphs
In this paper, we study Gromov hyperbolicity and related parameters, tha...
research
∙
11/30/2017
On density of subgraphs of Cartesian products
In this paper, we extend two classical results about the density of subg...
research
∙
11/30/2017
