{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:16:58Z","timestamp":1725862618789},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_5","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"64-77","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Secure Sets"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Woltran, S.: Computing secure sets in graphs using answer set programming. In: Proceedings of ASPOCP 2014 (2014)","DOI":"10.1093\/logcom\/exv060"},{"issue":"12","key":"5_CR2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"13","key":"5_CR3","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1016\/j.dam.2007.03.009","volume":"155","author":"RC Brigham","year":"2007","unstructured":"Brigham, R.C., Dutton, R.D., Hedetniemi, S.T.: Security in graphs. Discrete Appl. Math. 155(13), 1708\u20131714 (2007)","journal-title":"Discrete Appl. Math."},{"key":"5_CR4","unstructured":"de Haan, R., Szeider, S.: The parameterized complexity of reasoning problems beyond NP. In: Proceedings of KR 2014, pp. 82\u201391 (2014)"},{"key":"5_CR5","first-page":"161","volume":"189","author":"RI Enciso","year":"2008","unstructured":"Enciso, R.I., Dutton, R.D.: Parameterized complexity of secure sets. Congr. Numer. 189, 161\u2013168 (2008)","journal-title":"Congr. Numer."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ho, Y.Y.: Global secure sets of trees and grid-like graphs. Ph.D. thesis, University of Central Florida, Orlando, USA (2011)","DOI":"10.1016\/j.dam.2010.12.013"},{"issue":"29","key":"5_CR7","doi-asserted-by":"crossref","first-page":"3487","DOI":"10.1016\/j.tcs.2011.02.038","volume":"412","author":"D Marx","year":"2011","unstructured":"Marx, D.: Complexity of clique coloring and related problems. Theor. Comput. Sci. 412(29), 3487\u20133500 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10472-005-0432-6","volume":"43","author":"S Szeider","year":"2005","unstructured":"Szeider, S.: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1), 223\u2013238 (2005)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T00:52:43Z","timestamp":1568249563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}