1. Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73–76 (1980)
2. Amiri, S.A., Foerster, K.-T., Jacob, R., Schmid, S.: Charting the complexity landscape of waypoint routing. arXiv preprint arXiv:1705.00055 (2017)
3. Amiri, S.A., Foerster, K.-T., Schmid, S.: Walking through waypoints. arXiv preprint arXiv:1708.09827 (2017)
4. Lecture Notes in Computer Science;S Akhoondian Amiri,2014
5. Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Rodríguez, Y.N., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super) thin or solid is hard: a study of grid hamiltonicity. Comput. Geom. 42(6–7), 582–605 (2009)