In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...