38 citations · 173 across the 47 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
Parameterized Algorithms for Load Coloring Problem
Gregory Gutin, Mark Jones
One way to state the Load Coloring Problem (LCP) is as follows. Let be graph and let be a 2-coloring. An edge is calle…
cs.DS2013★ 24 cited
Iterative Plan Construction for the Workflow Satisfiability Problem
David Cohen, Jason Crampton, Andrei Gagarin +2
The \emph{Workflow Satisfiability Problem (WSP)} is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defi…