Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

Gregory Gutin
, Stefan Kratsch
, Magnus Wahlström

Research output: Contribution to journal › Article › peer-review

100 Downloads (Pure)

Original language	English
Pages (from-to)	1-20
Number of pages	20
Journal	Algorithmica
Early online date	18 Mar 2015
DOIs	https://doi.org/10.1007/s00453-015-9986-9
Publication status	Published - 2015

Access to Document

10.1007/s00453-015-9986-9

journalAccepted author manuscript, 356 KB

http://link.springer.com/article/10.1007%2Fs00453-015-9986-9

Parameterized Algorithmics for the Analysis and Verification of Constrained Workflow Systems
Gutin, G. (PI), Cohen, D. (CoI) & Crampton, J. (CoI)
Eng & Phys Sci Res Council EPSRC
1/02/13 → 1/05/16
Project: Research

Cite this

@article{b067be5dc30e46f489ef498649172431,

title = "Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem",

author = "Gregory Gutin and Stefan Kratsch and Magnus Wahlstr{\"o}m",

year = "2015",

doi = "10.1007/s00453-015-9986-9",

language = "English",

pages = "1--20",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

}