1. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways, for Your Mathematical Plays: Games in Particular, vol. 2. Academic Press, New York (1982)
2. Bodlaender, H.L., Nederlof, J.: Subexponential time algorithms for finding small tree and path decompositions. In: ESA 2015 Proceedings, pp. 179–190. Springer (2015)
3. Bonnet, É, Miltzow, T., Rzazewski, P.: Complexity of token swapping and its variants. In: Vollmer, H., Vallée, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 16:1–16:14, Dagstuhl, Germany (2017). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
4. Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geometry 42(1), 60–80 (2009)
5. Calinescu, G., Dumitrescu, A., Pach, J.: Reconfigurations in graphs and grids. In: LATIN 2006 Proceedings, pp. 262–273. Springer (2006)