| A linear-time algorithm for the longest path problem in rectangular grid graphs F Keshavarz-Kohjerdi, A Bagheri, A Asgharian-Sardroud Discrete Applied Mathematics 160 (3), 210-217, 2012 | 49 | 2012 |
| Hamiltonian paths in L-shaped grid graphs F Keshavarz-Kohjerdi, A Bagheri Theoretical Computer Science 621, 37-56, 2016 | 45 | 2016 |
| Hamiltonian paths in some classes of grid graphs F Keshavarz-Kohjerdi, A Bagheri Journal of Applied Mathematics 2012 (1), 475087, 2012 | 43 | 2012 |
| A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole F Keshavarz-Kohjerdi, A Bagheri Theoretical Computer Science 690, 26-58, 2017 | 36 | 2017 |
| A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole F Keshavarz-Kohjerdi, A Bagheri The Journal of Supercomputing 73 (9), 3821-3860, 2017 | 32 | 2017 |
| An efficient parallel algorithm for the longest path problem in meshes F Keshavarz-Kohjerdi, A Bagheri The Journal of Supercomputing 65, 723-741, 2013 | 29 | 2013 |
| Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs F Keshavarz-Kohjerdi, A Bagheri Discrete Optimization 35, 100554, 2020 | 24 | 2020 |
| Off-line exploration of rectangular cellular environments with a rectangular obstacle F Keshavarz-Kohjerdi Optimization Methods and Software 37 (5), 1805-1819, 2022 | 19 | 2022 |
| The Hamiltonian connectivity of alphabet supergrid graphs RW Hung, F Keshavarz-Kohjerdi, CB Lin, JS Chen IAENG International Journal of Applied Mathematics 49 (1), 2019 | 16 | 2019 |
| The Hamiltonicity, Hamiltonian connectivity, and longest (s, t)-path of L-shaped supergrid graphs F Keshavarz-Kohjerdi, RW Hung arXiv preprint arXiv:1904.02581, 2019 | 13 | 2019 |
| Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time F Keshavarz-Kohjerdi, RW Hung Algorithms 15 (2), 61, 2022 | 8 | 2022 |
| Longest (s, t)-paths in L-shaped grid graphs F Keshavarz-Kohjerdi, A Bagheri Optimization Methods and Software 34 (4), 797-826, 2019 | 7 | 2019 |
| Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time F Keshavarz-Kohjerdi, A Bagheri Applied Mathematics and Computation 436, 127513, 2023 | 3 | 2023 |
| Domination and independent domination in extended supergrid graphs JS Chen, RW Hung, F Keshavarz-Kohjerdi, YF Huang Algorithms 15 (11), 402, 2022 | 3 | 2022 |
| Embedding linear arrays of the maximum length in O-shaped meshes F Keshavarz-Kohjerdi The Journal of Supercomputing 78 (1), 884-918, 2022 | 3 | 2022 |
| Finding longest (s, t)-paths of O-shaped supergrid graphs in linear time RW Hung, F Keshavarz-Kohjerdi, YM Tseng, GH Qiu 2019 IEEE 10th International Conference on Awareness Science and Technology …, 2019 | 3 | 2019 |
| Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time RW Hung, F Keshavarz-Kohjerdi arXiv preprint arXiv:1908.07447, 2019 | 3 | 2019 |
| The Longest -paths of -shaped Supergrid Graphs RW Hung, F Keshavarz-Kohjerdi arXiv preprint arXiv:1911.08558, 2019 | 2 | 2019 |
| The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs F Keshavarz-Kohjerdi, RW Hung Mathematics 11 (12), 2712, 2023 | 1 | 2023 |
| The Hamiltonicity and Hamiltonian-connectivity of Solid Supergrid Graphs F Keshavarz-Kohjerdi, A Bagheri Bulletin of the Malaysian Mathematical Sciences Society 46 (3), 110, 2023 | 1 | 2023 |
Alireza BagheriAssociate Prof. of Computer Science, Amirkabir University of Technology在 aut.ac.ir 的电子邮件经过验证
