{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:03:57Z","timestamp":1742969037490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_18","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"208-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"18_CR1","unstructured":"American National Standards Institute. ANSI INCITS 359\u20132004 for role based access control (2004)"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/501978.501979","volume":"4","author":"E Bertino","year":"2001","unstructured":"Bertino, E., Bonatti, P.A., Ferrari, E.: TRBAC: a temporal role-based access control model. ACM Trans. Inf. Syst. Secur. 4(3), 191\u2013233 (2001)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/300830.300837","volume":"2","author":"E Bertino","year":"1999","unstructured":"Bertino, E., Ferrari, E., Atluri, V.: The specification and enforcement of authorization constraints in workflow management systems. ACM Trans. Inf. Syst. Secur. 2(1), 65\u2013104 (1999)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-17493-3_5","volume-title":"Parameterized and Exact Computation","author":"N Betzler","year":"2010","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R.: Partial kernelization for rank aggregation: theory and experiments. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 26\u201337. Springer, Heidelberg (2010)"},{"key":"18_CR5","unstructured":"Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M.: Iterative plan construction for the workflow satisfiability problem. CoRR, abs\/1306.3649v2 (2013)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-08016-1_5","volume-title":"Frontiers in Algorithmics","author":"D Cohen","year":"2014","unstructured":"Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M.: Engineering algorithms for workflow satisfiability problem with user-independent constraints. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 48\u201359. Springer, Heidelberg (2014)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Crampton, J.: A reference monitor for workflow systems with constrained task execution. In: SACMAT, pp. 38-47. ACM (2005)","DOI":"10.1145\/1063979.1063986"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-38756-2_21","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"J Crampton","year":"2013","unstructured":"Crampton, J., Crowston, R., Gutin, G., Jones, M., Ramanujan, M.S.: Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 198\u2013209. Springer, Heidelberg (2013)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2487222.2487226","volume":"16","author":"J Crampton","year":"2013","unstructured":"Crampton, J., Gutin, G., Yeo, A.: On the parameterized complexity and kernelization of the workflow satisfiability problem. ACM Trans. Inf. Syst. Secur. 16(1), 4 (2013)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Schulman, L.J. (ed.) STOC, pp. 251-260. ACM (2010)","DOI":"10.1145\/1806689.1806725"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-03898-8_18","volume-title":"Parameterized and Exact Computation","author":"D Hermelin","year":"2013","unstructured":"Hermelin, D., Kratsch, S., So\u0142tys, K., Wahlstr\u00f6m, M., Wu, X.: A completeness theory for polynomial (Turing) kernelization. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 202\u2013215. Springer, Heidelberg (2013)"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TKDE.2005.1","volume":"17","author":"J Joshi","year":"2005","unstructured":"Joshi, J., Bertino, E., Latif, U., Ghafoor, A.: A generalized temporal role-based access control model. IEEE Trans. Knowl. Data Eng. 17(1), 4\u201323 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"D Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization \u2013 preprocessing with a guarantee. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol. 7370, pp. 129\u2013161. Springer, Heidelberg (2012)"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.485845","volume":"29","author":"RS Sandhu","year":"1996","unstructured":"Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. IEEE Comput. 29(2), 38\u201347 (1996)","journal-title":"IEEE Comput."},{"issue":"4","key":"18_CR17","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. 13(4), 40 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T19:06:46Z","timestamp":1676660806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}