Publisher
Springer International Publishing
Reference26 articles.
1. Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y., Sikora, F.: Token sliding on split graphs. arXiv preprint (2018)
2. Lecture Notes in Computer Science;M Bonamy,2017
3. Lecture Notes in Computer Science;P Bonsma,2014
4. Demaine, E.D., et al.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132–142 (2015).
https://doi.org/10.1016/j.tcs.2015.07.037
5. Demaine, E.D., Rudoy, M.: A simple proof that the
$$(n^2-1)$$
-puzzle is hard. Theor. Comput. Sci. 732, 80–84 (2018).
https://doi.org/10.1016/j.tcs.2018.04.031
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献