11 citations · 26 across the 10 of their papers we have counts for
11 papers
Absolute value linear programming
Milan Hladík, David Hartman
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute…
Gadget construction and structural convergence
David Hartman, Tomáš Hons, Jaroslav Nešetřil
Nešetřil and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probabilit…
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
David Hartman, Aneta Pokorná, Pavel Valtr
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have…
Constructions of betweenness-uniform graphs from trees
David Hartman, Aneta Pokorná
Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that…
Positivity and convexity in incomplete cooperative games
Martin Černý, Jan Bok, David Hartman +1
Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the m…
Computing the spectral decomposition of interval matrices and a study on interval matrix power
David Hartman, Milan Hladík, David Říha
We present an algorithm for computing a spectral decomposition of an interval matrix as an enclosure of spectral decompositions of particular realizations of interval matrices. The…
The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
Andrés Aranda, David Hartman
We show that the independence number of a countably infinite HH-homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite and present a classification…
Regularity radius: Properties, approximation and a not a priori exponential algorithm
David Hartman, Milan Hladik
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible a…
Morphism extension classes of countable -colored graphs
Andrés Aranda, David Hartman
In~\cite{Hartman:2014}, Hartman, Hubi\v cka and Ma\v sulović studied the hierarchy of morphism extension classes for finite -colored graphs, that is, undirected graphs without l…
Complexities of relational structures
David Hartman, Jan Hubicka, Jaroslav Nesetril
The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal a…
Homomorphism-homogeneous L-colored graphs
David Hartman, Jan Hubicka, Dragan Masulovic
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homom…