: In this paper we describe a solution for the semi-automatic ontology based text annotation (OnTeA) tool. The tool analyzes a document or text using regular expression patterns an...
Michal Laclavik, Martin Seleng, Emil Gatial, Zolta...
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the su...
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...