Fatemeh Keshavarz-Kohjerdi

26 papers Journal 25Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
m-Watchmen's routes in minbar and generalized minbar polygons.
Comput. Geom.
Rahmat Ghasemi, Alireza Bagheri, Anna Brötzner, Fatemeh Keshavarz-Kohjerdi, Faezeh Farivar, Bengt J. Nilsson, Christiane Schmidt
2024 J jnl
Hamiltonian (s, t)-paths in solid supergrid graphs.
Comput. Appl. Math.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2024 J jnl
Paired Many-to-Many 2-Disjoint Path Covers in Meshes.
IEEE Trans. Parallel Distributed Syst.
Fatemeh Keshavarz-Kohjerdi
2024 J jnl
Separating Bichromatic Point Sets by an Axis-Parallel C-shaped Polygon.
J. Inf. Sci. Eng.
Fatemeh Keshavarz-Kohjerdi, Anita Sheybani, Alireza Bagheri
2024 J jnl
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs.
Int. J. Found. Comput. Sci.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2023 J jnl
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes.
Optim. Methods Softw.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2023 J jnl
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time.
Appl. Math. Comput.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2022 J jnl
Domination and Independent Domination in Extended Supergrid Graphs.
Algorithms
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yung-Fa Huang
2022 J jnl
Embedding linear arrays of the maximum length in O-shaped meshes.
J. Supercomput.
Fatemeh Keshavarz-Kohjerdi
2022 J jnl
Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time.
Algorithms
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
2022 J jnl
Off-line exploration of rectangular cellular environments with a rectangular obstacle.
Optim. Methods Softw.
Fatemeh Keshavarz-Kohjerdi
2020 J jnl
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs.
Discret. Optim.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2019 J jnl
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time.
CoRR
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
2019 — conf
Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time.
iCAST
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yuh-Min Tseng, Guo-Hao Qiu
2019 J jnl
Longest (s, t)-paths in L-shaped grid graphs.
Optim. Methods Softw.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2019 J jnl
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs.
CoRR
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
2019 J jnl
The Longest (s, t)-paths of O-shaped Supergrid Graphs.
CoRR
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
2017 J jnl
A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole.
Theor. Comput. Sci.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2017 J jnl
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole.
J. Supercomput.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2016 J jnl
Hamiltonian Paths in C-shaped Grid Graphs.
CoRR
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2016 J jnl
Hamiltonian paths in L-shaped grid graphs.
Theor. Comput. Sci.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2013 J jnl
An efficient parallel algorithm for the longest path problem in meshes.
J. Supercomput.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2012 J jnl
A linear-time algorithm for the longest path problem in rectangular grid graphs.
Discret. Appl. Math.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud
2012 J jnl
An efficient parallel algorithm for the longest path problem in meshes
CoRR
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2012 J jnl
Hamiltonian Paths in Some Classes of Grid Graphs.
J. Appl. Math.
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
2011 J jnl
Hamiltonian Paths in Two Classes of Grid Graphs
CoRR
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri