Fatemeh Keshavarz-Kohjerdi

Int. J. Found. Comput. Sci., April, 2024

Hamiltonian (s, t)-paths in solid supergrid graphs.

[BibT_eX]

[DOI]

Comput. Appl. Math., April, 2024

2023

A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes.

[BibT_eX]

[DOI]

Optim. Methods Softw., May, 2023

Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2023

2022

Embedding linear arrays of the maximum length in O-shaped meshes.

[BibT_eX]

[DOI]

J. Supercomput., 2022

Off-line exploration of rectangular cellular environments with a rectangular obstacle.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2022

Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time.

[BibT_eX]

[DOI]

Algorithms, 2022

Domination and Independent Domination in Extended Supergrid Graphs.

[BibT_eX]

[DOI]

Jong-Shin Chen

Yung-Fa Huang

Algorithms, 2022

2020

Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2020

2019

Longest (s, t)-paths in L-shaped grid graphs.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2019

The Longest (s, t)-paths of O-shaped Supergrid Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time.

[BibT_eX]

[DOI]

Yuh-Min Tseng

Guo-Hao Qiu

Proceedings of the IEEE 10th International Conference on Awareness Science and Technology, 2019

2017

A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole.

[BibT_eX]

[DOI]

J. Supercomput., 2017

A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

2016

Hamiltonian paths in L-shaped grid graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Hamiltonian Paths in C-shaped Grid Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

2013

An efficient parallel algorithm for the longest path problem in meshes.

[BibT_eX]

[DOI]

J. Supercomput., 2013

2012

Hamiltonian Paths in Some Classes of Grid Graphs.

[BibT_eX]

[DOI]

J. Appl. Math., 2012

A linear-time algorithm for the longest path problem in rectangular grid graphs.

[BibT_eX]

[DOI]

Asghar Asgharian-Sardroud

Discret. Appl. Math., 2012

2011

Hamiltonian Paths in Two Classes of Grid Graphs

[BibT_eX]

[DOI]