{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T04:27:06Z","timestamp":1783225626446,"version":"3.54.6"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s00224-016-9702-4","type":"journal-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T02:50:25Z","timestamp":1473735025000},"page":"737-758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Paradigms for Parameterized Enumeration"],"prefix":"10.1007","volume":"60","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian-Steffen","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"key":"9702_CR1","doi-asserted-by":"crossref","unstructured":"Chen, J., Chor, B., Fellows, M.R., Huang, X., Juedes, D.W., Kanji, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems 201(2), 216\u2013231 (2005)","DOI":"10.1016\/j.ic.2005.05.001"},{"issue":"6","key":"9702_CR2","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. Theor. Inf. Appl. 31(6), 499\u2013511 (1997)","journal-title":"Theor. Inf. Appl."},{"key":"9702_CR3","doi-asserted-by":"crossref","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics SIAM Discrete Mathematics and Applications (2001)","DOI":"10.1137\/1.9780898718546"},{"key":"9702_CR4","doi-asserted-by":"crossref","unstructured":"Creignou, N., Meier, A., M\u00fcller, J. S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. In: Proceedings International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 8087, pp 290\u2013301. Springer, Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-40313-2_27"},{"key":"9702_CR5","doi-asserted-by":"crossref","unstructured":"Creignou, N., Olive, F., Schmidt, J.: Enumerating all solutions of a Boolean CSP by non-decreasing weight. In: Proceedings International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, vol. 6695, pp 120\u2013133. Springer (2011)","DOI":"10.1007\/978-3-642-21581-0_11"},{"key":"9702_CR6","doi-asserted-by":"crossref","unstructured":"Creignou, N., Vollmer, H.: Boolean constraint satisfaction problems: When does Post\u2019s lattice help?. In: Complexity of Constraints, Lecture Notes in Computer Science, vol. 5250, pp 3\u201337. Springer (2008)","DOI":"10.1007\/978-3-540-92800-3_2"},{"issue":"3","key":"9702_CR7","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 351(3), 337\u2013350 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9702_CR8","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity, NY, USA (1999). doi: 10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9702_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. Texts in Computer Science, London, UK (2013). doi: 10.1007\/978-1-4471-5559-1"},{"key":"9702_CR10","doi-asserted-by":"crossref","unstructured":"Fernau, H.: On parameterized enumeration. Computing and Combinatorics (2002)","DOI":"10.1007\/3-540-45655-4_60"},{"key":"9702_CR11","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer (2006)"},{"issue":"4","key":"9702_CR12","doi-asserted-by":"crossref","first-page":"1964","DOI":"10.1137\/12089051X","volume":"27","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Saurabh, S., Villanger, Y.: A polynomial kernel for proper interval vertex deletion. SIAM J. Discr. Math. 27(4), 1964\u20131976 (2013)","journal-title":"SIAM J. Discr. Math."},{"issue":"3","key":"9702_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9702_CR14","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 88(1), 183\u2013189 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9702_CR15","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Marx, D., Wahlstr\u00f6m, M.: Parameterized complexity and kernelizability of max ones and exact ones problems, vol. 6281. Springer (2010)","DOI":"10.1007\/978-3-642-15155-2_43"},{"key":"9702_CR16","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"9702_CR17","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and binary clauses. In: Proceedings International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, vol. 3542 (2004)"},{"key":"9702_CR18","doi-asserted-by":"crossref","unstructured":"Nordh, G., Zanuttini, B.: Frozen boolean partial co-clones. In: Proceedings International Symposium on Multiple-Valued Logic, pp 120\u2013125 (2009)","DOI":"10.1109\/ISMVL.2009.10"},{"key":"9702_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.039","volume":"481","author":"S Ordyniak","year":"2013","unstructured":"Ordyniak, S., Paulusma, D., Szeider, S.: Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481, 85\u201399 (2013). doi: 10.1016\/j.tcs.2012.12.039","journal-title":"Theor. Comput. Sci."},{"key":"9702_CR20","unstructured":"Samer, M., Szeider, S.: Backdoor trees. In: Proceedings AAAI conference on artificial intelligence, pp 363\u2013368. AAAI Press (2008)"},{"key":"9702_CR21","unstructured":"Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., Van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Chapter 13, pp 425\u2013454 (2009)"},{"key":"9702_CR22","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings Annual Symposium on the Theory of Computing, pp 216\u2013226. ACM Press (1978)","DOI":"10.1145\/800133.804350"},{"key":"9702_CR23","unstructured":"Schmidt, J.: Enumeration: Algorithms and complexity. Master\u2019s Thesis, Leibniz Universit\u00e4t Hannover (2009)"},{"key":"9702_CR24","unstructured":"Schnorr, C.P.: Optimal algorithms for self-reducible problems. In: Proceedings International Colloquium on Automata, Languages, and Programming, pp 322\u2013337 (1976)"},{"key":"9702_CR25","doi-asserted-by":"crossref","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) Proceedings of the 6th International Conference Theory and Applications of Satisfiability (SAT\u201903). Selected and Revised Papers, vol. 2919, pp 188\u2013202 (2004)","DOI":"10.1007\/978-3-540-24605-3_15"},{"key":"9702_CR26","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: Proceedings International Joint Conference on Artificial Intelligence, pp 1173\u20131178 (2003)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9702-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9702-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9702-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:07:31Z","timestamp":1568376451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9702-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,13]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9702"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9702-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,13]]}}}