1. Asgharian-Sardroud A, Bagheri A (2016) An approximation algorithm for the longest path problem in solid grid graphs. Optim Methods Softw 31(3):47–493
2. Abuelrub EM (1993) Interconnection networks embeddings and efficient parallel computations, Louisiana State University and Agricultural & Mechanical College, PhD Thesis
3. Björklund A, Husfeldt T (2003) Finding a path of superlogarithmic length, SIAM. J Comput 32:1395–1402
4. Chen SD, Shen H, Topor R (2002) An efficient algorithm for constructing Hamiltonian paths in meshes. Parallel Comput 28:1293–1305
5. Chang RY, Hsu CH, Peng S (2012) The longest path problem on permutation graphs, The 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 294–297