1. Lecture Notes in Computer Science;G. Bagan,2006
2. Bagan, G., Durand, A., Grandjean, E., Olive, F.: Computing the jth element of a first-order query (submitted 2007)
3. Berge, C.: Graphs and hypergraphs, 2nd edn. Amsterdam (1973)
4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)