19 citations · 22 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CR2012
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
Jason Crampton, Gregory Gutin, Anders Yeo
A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements may impose constraints on which groups of users are permi…
cs.CC2012
(Non-)existence of Polynomial Kernels for the Test Cover Problem
G. Gutin, G. Muciaccia, A. Yeo
The input of the Test Cover problem consists of a set of vertices, and a collection of distinct subsets of , called tests. A test separates…