Fatemeh Keshavarz-Kohjerdi

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 19

Top Topics

Guillotine Cutting

Top Venues

Optim. Methods Softw.

J. Supercomput.

Publications

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs. Int. J. Found. Comput. Sci. 35 (3) (2024)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Hamiltonian (s, t)-paths in solid supergrid graphs. Comput. Appl. Math. 43 (3) (2024)
Fatemeh Keshavarz-Kohjerdi, Anita Sheybani, Alireza Bagheri
Separating Bichromatic Point Sets by an Axis-Parallel C-shaped Polygon. J. Inf. Sci. Eng. 40 (4) (2024)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time. Appl. Math. Comput. 436 (2023)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes. Optim. Methods Softw. 38 (3) (2023)
Fatemeh Keshavarz-Kohjerdi
Embedding linear arrays of the maximum length in O-shaped meshes. J. Supercomput. 78 (1) (2022)
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yung-Fa Huang
Domination and Independent Domination in Extended Supergrid Graphs. Algorithms 15 (11) (2022)
Fatemeh Keshavarz-Kohjerdi
Off-line exploration of rectangular cellular environments with a rectangular obstacle. Optim. Methods Softw. 37 (5) (2022)
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time. Algorithms 15 (2) (2022)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs. Discret. Optim. 35 (2020)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time. CoRR (2019)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
The Longest (s, t)-paths of O-shaped Supergrid Graphs. CoRR (2019)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Longest (s, t)-paths in L-shaped grid graphs. Optim. Methods Softw. 34 (4) (2019)
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs. CoRR (2019)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yuh-Min Tseng, Guo-Hao Qiu
Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time. iCAST (2019)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole. Theor. Comput. Sci. 690 (2017)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole. J. Supercomput. 73 (9) (2017)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Hamiltonian Paths in C-shaped Grid Graphs. CoRR (2016)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Hamiltonian paths in L-shaped grid graphs. Theor. Comput. Sci. 621 (2016)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
An efficient parallel algorithm for the longest path problem in meshes. J. Supercomput. 65 (2) (2013)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
An efficient parallel algorithm for the longest path problem in meshes CoRR (2012)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Hamiltonian Paths in Some Classes of Grid Graphs. J. Appl. Math. 2012 (2012)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud
A linear-time algorithm for the longest path problem in rectangular grid graphs. Discret. Appl. Math. 160 (3) (2012)
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Hamiltonian Paths in Two Classes of Grid Graphs CoRR (2011)