D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdr?álek, The dag-width of directed graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.4, pp.900-923, 2012.
DOI : 10.1016/j.jctb.2012.04.004

D. Berwanger, E. Grädel, L. Kaiser, and R. Rabinovich, Entanglement and the complexity of directed graphs, Theoretical Computer Science, vol.463, pp.2-25, 2012.
DOI : 10.1016/j.tcs.2012.07.010

H. Bjorklund, S. Sandberg, and S. Vorobyov, On fixed-parameter complexity of infinite games, The Nordic Workshop on Programming Theory (NWPT'03), number 34 inÅboinÅbo Akademi, pp.29-31, 2003.

H. Björklund, S. Sandberg, and S. G. Vorobyov, Memoryless determinacy of parity and mean payoff games: a simple proof, Theoretical Computer Science, vol.310, issue.1-3, pp.1-3365, 2004.
DOI : 10.1016/S0304-3975(03)00427-4

H. Björklund and S. G. Vorobyov, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Discrete Applied Mathematics, vol.155, issue.2, pp.210-229, 2007.
DOI : 10.1016/j.dam.2006.04.029

M. Bojanczyk, C. Dittmann, and S. Kreutzer, Decomposition theorems and model-checking for the modal µ-calculus, Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, p.17, 2014.

A. Browne, E. M. Clarke, S. Jha, D. E. Long, and W. R. Marrero, An improved algorithm for the evaluation of fixpoint expressions, Theoretical Computer Science, vol.178, issue.1-2, pp.237-255, 1997.
DOI : 10.1016/S0304-3975(96)00228-9

K. Chatterjee and T. A. Henzinger, A survey of stochastic ??-regular games, Journal of Computer and System Sciences, vol.78, issue.2, pp.394-413, 2012.
DOI : 10.1016/j.jcss.2011.05.002

J. Chen, X. Huang, I. A. Kanj, and G. Xia, On the computational hardness based on linear FPT-reductions, Journal of Combinatorial Optimization, vol.6, issue.2, pp.231-247, 2006.
DOI : 10.1007/s10878-006-7137-6

J. Chen, X. Huang, I. A. Kanj, and G. Xia, Strong computational lower bounds via parameterized complexity, Journal of Computer and System Sciences, vol.72, issue.8, pp.721346-1367, 2006.
DOI : 10.1016/j.jcss.2006.04.007

A. Condon, The complexity of stochastic games, Information and Computation, vol.96, issue.2, pp.203-224, 1992.
DOI : 10.1016/0890-5401(92)90048-K

C. Dittmann, S. Kreutzer, and A. I. Tomescu, Graph operations on parity games and polynomial-time algorithms. arXiv preprint arXiv:1208, 1640.

E. A. Emerson and C. S. Jutla, The Complexity of Tree Automata and Logics of Programs, SIAM Journal on Computing, vol.29, issue.1, pp.132-158, 1999.
DOI : 10.1137/S0097539793304741

E. A. Emerson, C. S. Jutla, and A. P. Sistla, On model checking for the ??-calculus and its fragments, Theoretical Computer Science, vol.258, issue.1-2, pp.491-522, 2001.
DOI : 10.1016/S0304-3975(00)00034-7

F. V. Fomin, M. Liedloff, P. Montealegre-barba, and I. Todinca, Algorithms parameterized by vertex cover and modular width, through potential maximal cliques, Algorithm Theory - SWAT 2014 -14th Scandinavian Symposium and Workshops Proceedings, volume 8503 of Lecture Notes in Computer Science, pp.182-193, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00984059

J. Gajarsk´ygajarsk´y, M. Lampis, and S. Ordyniak, Parameterized Algorithms for Modular-Width, Parameterized and Exact Computation -8th International Symposium, IPEC 2013, pp.163-176, 2013.
DOI : 10.1007/978-3-319-03898-8_15

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, Lecture Notes in Computer Science, vol.2500, 2001.
DOI : 10.1007/3-540-36387-4

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

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

M. Jurdzinski, Deciding the winner in parity games is in UP ??? co-UP, Information Processing Letters, vol.68, issue.3, pp.119-124, 1998.
DOI : 10.1016/S0020-0190(98)00150-1

M. Jurdzinski, Small Progress Measures for Solving Parity Games, STACS, pp.290-301, 2000.
DOI : 10.1007/3-540-46541-3_24

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

R. Küsters, Memoryless Determinacy of Parity Games, Grädel et al, pp.95-106
DOI : 10.1007/3-540-36387-4_6

R. Mcnaughton, Infinite games played on finite graphs, Annals of Pure and Applied Logic, vol.65, issue.2, pp.149-184, 1993.
DOI : 10.1016/0168-0072(93)90036-D

J. Obdr?álek, Fast Mu-Calculus Model Checking when Tree-Width Is Bounded, Computer Aided Verification, 15th International Conference, CAV 2003 Proceedings, volume 2725 of Lecture Notes in Computer Science, pp.80-92, 2003.
DOI : 10.1007/978-3-540-45069-6_7

J. Obdr?álek, Clique-Width and Parity Games, 16th Annual Conference of the EACSL Proceedings, pp.54-68, 2007.
DOI : 10.1007/978-3-540-74915-8_8

S. Schewe, Solving parity games in big steps, FSTTCS, pp.449-460, 2007.
DOI : 10.1016/j.jcss.2016.10.002

W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, vol.200, issue.1-2, pp.135-183, 1998.
DOI : 10.1016/S0304-3975(98)00009-7

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3