D. Phd, P. , P. , and C. , , 2004.

W. Lindner, M. Mesiti, C. Türker, Y. Tzitzikas, and A. Vakali, Lecture 505 Notes in Computer Science, vol.3268, pp.557-567, 2004.

V. Acuña, P. V. Milreu, L. Cottret, A. Marchetti-spaccamela, L. Stougie et al., Algorithms and 507 complexity of enumerating minimal precursor sets in genome-wide metabolic networks, Bioinformatics, vol.508, pp.2474-2483, 2012.

K. A. Dill, A. Lucas, J. Hockenmaier, L. Huang, D. Chiang et al., Computational linguistics: A 510 new tool for exploring biopolymer structures and statistical mechanics, Polymer, vol.48, pp.4289-4300, 2007.

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, On Generating All Maximal Independent Sets

, Information Processing Letters, vol.27, pp.119-123, 1988.

K. Sörensen and G. K. Janssens, An algorithm to generate all spanning trees of a graph in order of increasing 515 cost, Pesquisa Operacional, vol.25, pp.219-229, 2005.

N. Creignou and J. J. Hébrard, On generating all solutions of generalized satisfiability problems, Theoretical 517 Informatics and Applications, vol.31, pp.499-511, 1997.

N. Creignou, F. Olive, and J. Schmidt, Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
URL : https://hal.archives-ouvertes.fr/hal-01195416

, Proc. SAT, vol.6695, pp.120-133, 2011.

H. Fernau, On parameterized enumeration. Computing and Combinatorics, vol.521, p.10, 2002.

P. Damaschke, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

, Theoretical Computer Science, vol.351, pp.337-350, 2006.

F. V. Fomin, S. Saurabh, and Y. Villanger, A Polynomial Kernel for Proper Interval Vertex Deletion, SIAM 524 Journal Discrete Mathematics, vol.27, pp.1964-1976, 2013.

N. Creignou, A. Meier, J. Müller, J. Schmidt, and H. Vollmer, Paradigms for Parameterized Enumeration. 526 Theory of Computing Systems, vol.60, pp.737-758, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01194386

R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Applied Mathematics, vol.528, pp.173-182, 2004.

M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic Discrete Methods, vol.530, p.15, 1981.

M. Yannakakis, Node-and edge-deletion NP-complete problems, Proc. STOC, vol.532, p.16, 1978.

J. Gramm, R. Niedermeier, and P. Rossmanith, Fixed-Parameter Algorithms for CLOSEST STRING and 533 Related Problems, vol.37, pp.25-42, 2003.

R. Williams, C. P. Gomes, and B. Selman, Backdoors To Typical Case Complexity. IJCAI-03, Proceedings of the 535

, Eighteenth International Joint Conference on Artificial Intelligence, pp.1173-1178, 2003.

M. Kröll, R. Pichler, and S. Skritek, On the Complexity of Enumerating the Answers to Well-designed Pattern 538

, Trees. 19th International Conference on Database Theory, 2016.

W. Martens, , vol.539

, Leibniz International 540 Proceedings in Informatics (LIPIcs), vol.48, p.19, 2016.

M. Bentert, T. Fluschnik, A. Nichterlein, and R. Niedermeier, Parameterized aspects of triangle enumeration, Journal of Computer and System Sciences, vol.542, pp.61-77, 2019.

F. Bökler, M. Ehrgott, C. Morris, and P. Mutzel, Output-sensitive complexity of multiobjective combinatorial 544 optimization, vol.24, p.21, 2017.

M. Kröll, R. Pichler, and S. Woltran, On the Complexity of Enumerating the Extensions of Abstract 546

, Argumentation Frameworks, Proceedings of the 26th International Joint Conference on Artificial 547 Intelligence, vol.548, p.22, 2017.

C. Carbonnel and E. Hebrard, On the Kernelization of Global Constraints, Proceedings of the Twenty-Sixth, vol.549
URL : https://hal.archives-ouvertes.fr/hal-01670318

, International Joint Conference on Artificial Intelligence, 2017.

C. Sierra, , vol.551, p.23, 2017.

J. Schmidt, Enumeration: Algorithms and Complexity

, Dagstuhl Reports, vol.4, p.26, 2014.

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness

W. ,

&. Freeman and . Co, , vol.559, p.27, 1990.

L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, vol.81, p.38, 2019.

M. Kronegger, S. Ordyniak, and A. Pfandler, Backdoors to planning, Artificial Intelligence, vol.269, p.39, 2019.

R. Ganian, M. S. Ramanujan, and S. Szeider, Combining Treewidth and Backdoors for CSP, 34th Symposium 583 on Theoretical Aspects of Computer Science, STACS 2017, p.584, 2017.

, LIPIcs, vol.66, p.40, 2017.

S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, and S. Zivny, Backdoors into heterogeneous classes of SAT, p.587

, CSP. Journal of Computer and System Sciences, vol.85, p.41, 2017.

N. Nishimura, P. Ragde, and S. Szeider, Solving #SAT using vertex covers, Acta Informatica, vol.44, pp.509-523, 2007.

S. Szeider, Matched Formulas and Backdoor Sets, JSAT, vol.6, p.43, 2009.

S. Gaspers and S. Szeider, Backdoors to Satisfaction, The Multivariate Algorithmic Revolution and Beyond

H. Springer-berlin, LNCS, vol.7370, p.44, 2012.

T. J. Schaefer, The Complexity of Satisfiability Problems, Proceedings of the 10th Annual ACM Symposium