A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2544

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino, Generating Partial and Multiple Transversals of a Hypergraph, Proceedings 27th International Conference on Automata, Languages, and Programming, 2000.
DOI : 10.1007/3-540-45022-X_50

K. Compton and C. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Annals of Pure and Applied Logic 48, pp.1-79, 1990.
DOI : 10.1016/0168-0072(90)90080-L

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

T. Eiter, G. Gottlob, and K. Makino, New Results on Monotone Dualization and Generating Hypergraph Transversals, SIAM Journal on Computing, vol.32, issue.2, pp.514-537, 2003.
DOI : 10.1137/S009753970240639X
URL : http://arxiv.org/abs/cs/0204009

J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, Journal of the ACM, vol.49, issue.6, pp.716-752, 2002.
DOI : 10.1145/602220.602222
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.8500

M. Frick and M. Grohe, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, vol.48, issue.6, pp.1184-1206, 2001.
DOI : 10.1145/504794.504798

H. Gaifman, On local and nonlocal properties, Logic Colloquium'81, pp.105-135, 1982.

L. A. Goldberg, Listing graphs that satisfy first-order sentences, Journal of Computer and System Sciences, vol.49, issue.2, pp.408-424, 1994.
DOI : 10.1016/S0022-0000(05)80057-1
URL : http://doi.org/10.1016/s0022-0000(05)80057-1

E. Grandjean and F. Olive, Graph properties checkable in linear time in the number of vertices, Journal of Computer and System Sciences, vol.68, issue.3, pp.546-597, 2004.
DOI : 10.1016/j.jcss.2003.09.002
URL : https://hal.archives-ouvertes.fr/hal-00255804

E. Grandjean and T. Schwentick, Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time, SIAM Journal on Computing, vol.32, issue.1, pp.196-230, 2002.
DOI : 10.1137/S0097539799360240
URL : https://hal.archives-ouvertes.fr/hal-00255039

W. Hanf, Model-theoretic methods in the study of elementary logic In The Theory of Models, pp.132-145, 1965.

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos, Generating all maximal models of a Boolean expression, Information Processing Letters, vol.74, issue.3-4, pp.3-4, 2000.
DOI : 10.1016/S0020-0190(00)00023-5

L. Libkin, Elements of finite model theory. EATCS Series, 2004.

S. Lindell, Computing monadic fixed-point in linear-time on doubly-linked data structures, 7th Workshop on Logic and Computational Complexity (LCC'05), 2005.

J. Plehn and B. Voigt, Finding minimally weighted subgraphs, 16th workshop on graph theoretic concepts in computer science, pp.18-29, 1990.
DOI : 10.1007/3-540-53832-1_28

M. Rabin, A simple method of undecidability proofs and some applications, Logic, Methodology and Phylosophy of Science, pp.58-68, 1964.

N. Robertson and P. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.92-114, 1984.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1999.1919

D. Seese, Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees, pp.83-114, 1992.

D. Seese, Linear time computable problems and first-order descriptions, Mathematical Structures in Computer Science, vol.6, issue.6, pp.505-526, 1996.
DOI : 10.1016/s1571-0661(05)80203-8
URL : http://doi.org/10.1016/s1571-0661(05)80203-8

M. Y. Vardi, On the complexity of bounded-variable queries, ACM Symposium on Principles of Database Systems, pp.266-276, 1995.