38 citations · 173 across the 47 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DM2013
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound
Robert Crowston, Mark Jones, Gabriele Muciaccia +3
Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of λ-extendible properties of graphs as a generalization of the property of being bipartite. They showed that fo…
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…