{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:11Z","timestamp":1725745391423},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_27","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"290-301","source":"Crossref","is-referenced-by-count":4,"title":["Paradigms for Parameterized Enumeration"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian-Steffen","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N. Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.-J.: On generating all solutions of generalized satisfiability problems. Theoretical Informatics and Applications\u00a031(6), 499\u2013511 (1997)","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.-S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. CoRR, arXiv:1306.2171 (2013)","DOI":"10.1007\/978-3-642-40313-2_27"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-21581-0_11","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"N. Creignou","year":"2011","unstructured":"Creignou, N., Olive, F., Schmidt, J.: Enumerating all solutions of a Boolean CSP by non-decreasing weight. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 120\u2013133. Springer, Heidelberg (2011)"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. TCS\u00a0351(3), 337\u2013350 (2006)","journal-title":"TCS"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Fernau, H.: On parameterized enumeration. Computing and Combinatorics (2002)","DOI":"10.1007\/3-540-45655-4_60"},{"key":"27_CR6","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. IPL\u00a027(3), 119\u2013123 (1988)","journal-title":"IPL"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(91)90081-C","volume":"88","author":"S. Khuller","year":"1991","unstructured":"Khuller, S., Vazirani, V.V.: Planar graph coloring is not self-reducible, assuming P \u2260 NP. TCS\u00a088(1), 183\u2013189 (1991)","journal-title":"TCS"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-15155-2_43","volume-title":"Mathematical Foundations of Computer Science 2010","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Marx, D., Wahlstr\u00f6m, M.: Parameterized complexity and kernelizability of max ones and exact ones problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 489\u2013500. Springer, Heidelberg (2010)"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00037-005-0195-9","volume":"14","author":"D. Marx","year":"2005","unstructured":"Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity\u00a0(14), 153\u2013183 (2005)","journal-title":"Computational Complexity"},{"key":"27_CR11","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to horn and binary clauses. In: Proc. SAT (2004)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Nordh, G., Zanuttini, B.: Frozen boolean partial co-clones. In: Proc. ISMVL, pp. 120\u2013125 (2009)","DOI":"10.1109\/ISMVL.2009.10"},{"key":"27_CR13","unstructured":"Samer, M., Szeider, S.: Backdoor trees. In: Proc. AAAI, pp. 363\u2013368. AAAI Press (2008)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC, pp. 216\u2013226. ACM Press (1978)","DOI":"10.1145\/800133.804350"},{"key":"27_CR15","unstructured":"Schmidt, J.: Enumeration: Algorithms and complexity. Master\u2019s thesis, Leibniz Universit\u00e4t Hannover (2009)"},{"key":"27_CR16","unstructured":"Schnorr, C.P.: Optimal algorithms for self-reducible problems. In: Proc. ICALP, pp. 322\u2013337 (1976)"},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.disopt.2010.07.003","volume":"8","author":"S. Szeider","year":"2011","unstructured":"Szeider, S.: The parameterized complexity of k-flip local search for SAT and MAX SAT. Discrete Optimization\u00a08(1), 139\u2013145 (2011)","journal-title":"Discrete Optimization"},{"key":"27_CR18","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: Proc. IJCAI, pp. 1173\u20131178 (2003)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:12:33Z","timestamp":1558318353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}