Fatemeh Keshavarz-Kohjerdi

According to our database, Fatemeh Keshavarz-Kohjerdi authored at least 23 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Paired Many-to-Many 2-Disjoint Path Covers in Meshes.

Fatemeh Keshavarz-Kohjerdi

IEEE Trans. Parallel Distributed Syst., October, 2024

Separating Bichromatic Point Sets by an Axis-Parallel C-shaped Polygon.

Fatemeh Keshavarz-Kohjerdi, Anita Sheybani, Alireza Bagheri

J. Inf. Sci. Eng., July, 2024

The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

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

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Comput. Appl. Math., April, 2024

2023

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Optim. Methods Softw., May, 2023

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Appl. Math. Comput., 2023

2022

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

Fatemeh Keshavarz-Kohjerdi

J. Supercomput., 2022

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

Fatemeh Keshavarz-Kohjerdi

Optim. Methods Softw., 2022

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

Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung

Algorithms, 2022

Domination and Independent Domination in Extended Supergrid Graphs.

Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yung-Fa Huang

Algorithms, 2022

2020

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Discret. Optim., 2020

2019

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Optim. Methods Softw., 2019

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

Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi

CoRR, 2019

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

Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung

CoRR, 2019

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

Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, 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.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

J. Supercomput., 2017

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Theor. Comput. Sci., 2017

2016

Hamiltonian paths in L-shaped grid graphs.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Theor. Comput. Sci., 2016

Hamiltonian Paths in C-shaped Grid Graphs.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

CoRR, 2016

2013

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

J. Supercomput., 2013

2012

Hamiltonian Paths in Some Classes of Grid Graphs.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

J. Appl. Math., 2012

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

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud

Discret. Appl. Math., 2012

2011

Hamiltonian Paths in Two Classes of Grid Graphs

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

CoRR, 2011