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
∙
12/31/2022
Isometric path complexity of graphs
We introduce and study a new graph parameter, called the isometric path ...
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
∙
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
∙
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
∙
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
∙
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
∙
02/19/2018
