{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T21:40:26Z","timestamp":1785447626189,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387555","type":"print"},{"value":"9783642387562","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_21","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"198-209","source":"Crossref","is-referenced-by-count":9,"title":["Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints"],"prefix":"10.1007","author":[{"given":"J.","family":"Crampton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Crowston","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Jones","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H.: A linear time algorithm for finding tree decompositions of small treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H. Bodlaender","year":"2010","unstructured":"Bodlaender, H., Koster, A.: Treewidth computations I. Upper bounds. Information and Computation\u00a0208(3), 259\u2013275 (2010)","journal-title":"Information and Computation"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Crampton, J., Crowston, R., Gutin, G., Jones, M., Ramanujan, M.: Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints. CoRR abs\/1210.3978 (2012)","DOI":"10.1007\/978-3-642-38756-2_21"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Crampton, J.: A reference monitor for workflow systems with constrained task execution. In: SACMAT 2005, pp. 38\u201347 (2005)","DOI":"10.1145\/1063979.1063986"},{"key":"21_CR6","unstructured":"Crampton, J., Gutin, G.: Constraint Expressions and Workflow Satisfiability. In: SACMAT 2013 (to appear, 2013)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Crampton, J., Gutin, G., Yeo, A.: On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inform. System & Secur. (to appear), Preliminary version in. ACM Conf. Comput. & Communic. Secur., pp. 857\u2013868 (2012)","DOI":"10.1145\/2382196.2382287"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2012.11.038","volume":"472","author":"M.R. Fellows","year":"2013","unstructured":"Fellows, M.R., Friedrich, T., Hermelin, D., Narodytska, N., Rosamond, F.A.: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci.\u00a0472, 81\u201389 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. Springer (2006)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"Comput. Syst. Sci."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kloks, T. (ed.): Treewidth. Computations and Approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0045375"},{"issue":"1","key":"21_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.4086\/toc.2010.v006a005","volume":"6","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Can you beat treewidth? Theory of Computing 6(1), 85\u2013112 (2010)","journal-title":"Theory of Computing"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1880022.1880034","volume":"13","author":"Q. Wang","year":"2010","unstructured":"Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur.\u00a013(4), 40 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:42:47Z","timestamp":1746009767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}