15 citations · 56 across the 27 of their papers we have counts for
4 papers · 1 filter
Parameterized Study of the Test Cover Problem
R. Crowston, G. Gutin, M. Jones +2
We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\sc Test Cover} probl…
Fixed-parameter tractability of satisfying beyond the number of variables
R. Crowston, G. Gutin, M. Jones +3
We consider a CNF formula as a multiset of clauses: . The set of variables of will be denoted by . Let denote the bipartite graph with parti…
Parameterizations of Test Cover with Bounded Test Sizes
Robert Crowston, Gregory Gutin, Mark Jones +2
In the {\sc Test Cover} problem we are given a hypergraph with , and we assume that is a test cover, i.e. for every pair…
On the Meyniel condition for hamiltonicity in bipartite digraphs
Janusz Adamus, Lech Adamus
We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For k greater than or equal to 2, a bipartite digraph D with colour classes of cardinalit…