D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer, DAG-Width and Parity Games, Proceedings of Annual Symposium on Theoretical Aspects of Computer Science (STACS'06), pp.524-536, 2006.
DOI : 10.1007/11672142_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.9018

D. Berwanger and E. Grädel, Entanglement ??? A Measure for the Complexity of Directed Graphs with Applications to Logic and Games, Proceedings of Logic for Programming and Automated Reasoning (LPAR'05), pp.209-223, 2005.
DOI : 10.1007/978-3-540-32275-7_15

E. A. Emerson and C. S. Jutla, Tree Automata, Mu-Calculus and Determinacy (Extended Abstract), Proceedings of Symposium on Foundations of Computer Science (FOCS'91), pp.368-377, 1991.
DOI : 10.1109/sfcs.1991.185392

Y. Gurevich and L. Harrington, Trees, automata, and games, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.60-65, 1982.
DOI : 10.1145/800070.802177

P. Hunter and S. Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoretical Computer Science, vol.399, issue.3, pp.206-219, 2008.
DOI : 10.1016/j.tcs.2008.02.038
URL : http://doi.org/10.1016/j.tcs.2008.02.038

M. Jurdzinski, M. Paterson, and U. Zwick, A Deterministic Subexponential Algorithm for Solving Parity Games, SIAM Journal on Computing, vol.38, issue.4, pp.1519-1532, 2008.
DOI : 10.1137/070686652

J. Obdrzalek, Fast Mu-Calculus Model Checking when Tree-Width Is Bounded, Proceedings Computer Aided Verification (CAV'03), pp.80-92, 2003.
DOI : 10.1007/978-3-540-45069-6_7

J. Obdrzálek, Clique-Width and Parity Games, Proceedings of Computer Science Logic (CSL'07), pp.54-68, 2007.
DOI : 10.1007/978-3-540-74915-8_8