Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. For example, we define a notion of diagonalization of s...
st sacred importance of an abstract and one-dimensional genetic code—a code so thinly connected to the full-fleshed reality of our selves that its entire import could be captured...
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...