S. P. Vadhan, The Complexity of Counting in Sparse, Regular, and Planar Graphs, SIAM Journal on Computing, vol.31, issue.2, pp.398-427, 2001.
DOI : 10.1137/S0097539797321602

L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-2010304, 1979.
DOI : 10.1016/0304-3975(79)90044-6

L. A. Goldberg, R. Gysel, and J. Lapinskas, Approximately counting locallyoptimal structures, J. Comput. Syst. Sci, vol.82, issue.6

T. Eiter, K. Makino, and G. Gottlob, Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics, vol.156, issue.11, pp.2035-2049, 2008.
DOI : 10.1016/j.dam.2007.04.017

A. Durand and M. Hermann, On the counting complexity of propositional circumscription, Information Processing Letters, vol.106, issue.4, 2008.
DOI : 10.1016/j.ipl.2007.11.006

F. Capelli, Structural restrictions of cnf formulas: application to model counting and knowledge compilation, 2016.

M. M. Kanté, V. Limouzy, A. Mary, L. Nourine, and T. Uno, On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs, Algorithms and computation Lecture Notes in Comput. Sci, vol.8283, pp.339-349
DOI : 10.1007/978-3-642-45030-3_32

P. A. Golovach, P. Heggernes, M. M. Kanté, D. Kratsch, S. H. Saether et al., Output-polynomial enumeration on graphs of bounded (local) linear mim-width, Algorithmica, pp.1-28, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02083480

T. Eiter and G. Gottlob, Hypergraph Transversal Computation and Related Problems in Logic and AI, European Workshop on Logics in Artificial Intelligence, pp.549-564, 2002.
DOI : 10.1007/3-540-45757-7_53

J. Brault-baron, F. Capelli, and S. , Understanding model counting for beta-acyclic cnf-formulas, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, pp.143-156, 2015.

F. Capelli, Understanding the complexity of #SAT using knowledge compilation, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
DOI : 10.1109/LICS.2017.8005121
URL : https://hal.archives-ouvertes.fr/hal-01836195

T. Eiter and G. Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, 1995.
DOI : 10.1137/S0097539793250299

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

R. Diestel and G. Theory, 173 in Graduate Texts in Mathematics, 2005.

T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, of Monographs and Textbooks in Pure and Applied Mathematics, 1998.

M. M. Kanté, V. Limouzy, A. Mary, and L. Nourine, On the Enumeration of Minimal Dominating Sets and Related Notions, SIAM Journal on Discrete Mathematics, vol.28, issue.4
DOI : 10.1137/120862612

B. Courcelle, The monadic second-order logic of graphs XVI : Canonical graph decompositions, Logical Methods in Computer Science, vol.19, issue.2
DOI : 10.1017/CBO9780511629563
URL : https://hal.archives-ouvertes.fr/hal-00334069

M. M. Kanté and T. Uno, Counting Minimal Dominating Sets, pp.333-347, 2017.
DOI : 10.1016/0304-3975(79)90044-6

A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics (SIAM), 1999.