1. Ansotegui, C., Gomes, C.P., Selman, B.: The Achilles’ heel of QBF. In: AAAI 2005, pp. 275–281 (2005). http://dl.acm.org/citation.cfm?id=1619332.1619378
2. Arneson, B., Hayward, R., Henderson, P.: MoHex wins Hex tournament. ICGA J. 32(2), 114 (2009)
3. Biere, A., Lonsing, F., Seidl, M.: Blocked clause elimination for QBF. In: Bjorner, N., Sofronie-Stokkermans, V. (eds.) CADE. LNCS, vol. 6803, pp. 101–115. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22438-6_10
4. Bonnet, É., Gaspers, S., Lambilliotte, A., Rümmele, S., Saffidine, A.: The parameterized complexity of positional games. In: ICALP 2017, pp. 90:1–90:14 (2017)
5. Bonnet, É., Jamain, F., Saffidine, A.: On the complexity of connection games. Theor. Comput. Sci. (TCS) 644, 2–28 (2016)