Keshavarz-Kohjerdi, Fatemeh; Bagheri, Alireza Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs. (English) Zbl 1506.05113 Discrete Optim. 35, Article ID 100554, 34 p. (2020). MSC: 05C45 05C38 68R10 PDFBibTeX XMLCite \textit{F. Keshavarz-Kohjerdi} and \textit{A. Bagheri}, Discrete Optim. 35, Article ID 100554, 34 p. (2020; Zbl 1506.05113) Full Text: DOI
Keshavarz-Kohjerdi, Fatemeh; Bagheri, Alireza Longest \((s, t)\)-paths in \(L\)-shaped grid graphs. (English) Zbl 1414.05164 Optim. Methods Softw. 34, No. 4, 797-826 (2019). MSC: 05C38 05C12 68R10 PDFBibTeX XMLCite \textit{F. Keshavarz-Kohjerdi} and \textit{A. Bagheri}, Optim. Methods Softw. 34, No. 4, 797--826 (2019; Zbl 1414.05164) Full Text: DOI
Keshavarz-Kohjerdi, Fatemeh; Bagheri, Alireza; Asgharian-Sardroud, Asghar A linear-time algorithm for the longest path problem in rectangular grid graphs. (English) Zbl 1237.05115 Discrete Appl. Math. 160, No. 3, 210-217 (2012). MSC: 05C38 05C45 05C85 PDFBibTeX XMLCite \textit{F. Keshavarz-Kohjerdi} et al., Discrete Appl. Math. 160, No. 3, 210--217 (2012; Zbl 1237.05115) Full Text: DOI