A. Barvinok, Two Algorithmic Results for the Traveling Salesman Problem, Mathematics of Operations Research, vol.21, issue.1, pp.65-84, 1996.
DOI : 10.1287/moor.21.1.65

H. L. Bodlaender, NC-algorithms for graphs with small treewidth, Proc. 14th Workshop Graph- Theoretic Concepts in Computer Science WG'88, pp.1-10, 1989.
DOI : 10.1007/3-540-50728-0_32

H. L. Bodlaender and T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pp.268-279, 1995.
DOI : 10.1007/3-540-60084-1_80

P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory. Number 7 in Algorithms and Computation in Mathematics, 2000.

B. Courcelle, Graph grammars, monadic second-order logic and the theory of graph minors, Contemporary Mathematics, vol.147, pp.565-590, 1993.
DOI : 10.1090/conm/147/01200

B. Courcelle, J. A. Makowsky, and U. Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, Discrete Applied Mathematics, vol.108, issue.1-2, pp.23-52, 2001.
DOI : 10.1016/S0166-218X(00)00221-3

W. Espelage, F. Gurski, and E. Wanke, How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time, Lecture Notes in Computer Science, p.2204, 2001.
DOI : 10.1007/3-540-45477-2_12

P. W. Kasteleyn, Graph theory and crystal physics, Graph Theory and Theoretical Physics, pp.43-110, 1967.

A. K. Mackworth and Y. Zhang, Parallel and Distributed Finite Constraint Satisfaction, 1992.

M. Mahajan, P. R. Subramanya, and V. Vinay, The combinatorial approach yields an NC algorithm for computing Pfaffians, Discrete Applied Mathematics, vol.143, issue.1-3, pp.1-16, 2004.
DOI : 10.1016/j.dam.2003.12.001

J. A. Makowsky and K. Meer, Polynomials of bounded treewidth, Foundations of Computational Mathematics, Proceedings of the Smalefest, pp.211-250, 2000.

G. Malod, Polynômes et coefficients, 2003.

G. Malod and N. Portier, Characterizing Valiant???s Algebraic Complexity Classes, MFCS 2006 Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, pp.704-716, 2006.
DOI : 10.1007/11821069_61
URL : http://doi.org/10.1016/j.jco.2006.09.006

S. Toda, Classes of arithmetic circuits capturing the complexity of computing the determinant, IEICE Transactions on Information and Systems, pp.116-124, 1992.

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

L. G. Valiant, Completeness classes in algebra, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.249-261, 1979.
DOI : 10.1145/800135.804419

L. G. Valiant, Reducibility by algebraic projections, Logic and Algorithmic (an International Symposium held in honour of Ernst Specker), pp.365-380, 1982.

L. G. Valiant, Holographic Algorithms, Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, pp.306-315, 2004.
DOI : 10.1137/070682575