1. [1] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 4th ed., The MIT Press, 2022.
2. [2] M. Briański, S. Felsner, J. Hodor, and P. Micek, “Reconfiguring Independent Sets on Interval Graphs,” 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), ed. F. Bonchi and S.J. Puglisi, Leibniz International Proceedings in Informatics (LIPIcs), vol.202, Dagstuhl, Germany, pp.23:1-23:14, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
3. [3] R. Belmonte, E.J. Kim, M. Lampis, V. Mitsou, Y. Otachi, and F. Sikora, “Token sliding on split graphs,” Theory Comput. Syst., vol.65, no.4, pp.662-686, 2021. 10.1007/s00224-020-09967-8
4. [4] P. Bonsma and L. Cereceda, “Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances,” Theor. Comput. Sci., vol.410, no.50, pp.5215-5226, 2009. 10.1016/j.tcs.2009.08.023
5. [5] R.A. Hearn and E.D. Demaine, “PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation,” Theor. Comput. Sci., vol.343, no.1-2, pp.72-96, 2005. 10.1016/j.tcs.2005.05.008