A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal of a hypergraph is a set of vertices such that every hyperedge has at least k elements of. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union of k pairwise disjoint transversals and such partition can be obtained in polynomial time. We give an N...

Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space. In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a no...

The structure generating function of a language enumerates the number of distinct words contained in the language with respect to their length. Given any unambiguous tuple grammar, a method is described which yields a system of equations, whose unique solution is the structure generating function. The entropy (channel capacity) is an important information theoretic quantity associated with a la...

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

This study examined spatial memory as measured by radial arm maze (RAM) performance after exposure to two stress conditions and a normothermic-unrestrained control condition. Male Fischer 344 rats were trained on the win-shift RAM procedure for 7 days, by which time they achieved asymptotic performance. The next day, rats in the two stress groups were exposed to 15 min of restraint in either 37...

In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called BMVA). An input of this problem is defined by m disjoint sets V , V , . . . , V , each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each set V . To each m-tuple we asso...