Fatemeh Keshavarz-Kohjerdi
Papers
2
Total Citations
6
H-Index
2
About
Fatemeh Keshavarz-Kohjerdi is a leading researcher in algorithmic graph theory and computational geometry, with a primary focus on the Hamiltonian cycle problem in grid graphs. Her work addresses one of the most fundamental NP-complete problems in graph theory, developing efficient polynomial-time solutions for structured graph families. She has made major contributions by designing linear-time algorithms for finding Hamiltonian cycles in rectangular grid graphs with obstacles and holes—problems with direct applications to robotic path planning, VLSI design, and cellular exploration. Notably, her 2021 paper on off-line exploration of rectangular cellular environments with a rectangular obstacle (4 citations) provides a linear-time algorithm for computing the shortest tour that visits every cell and returns to the start. Her 2023 work extends this to grid graphs with two rectangular holes (2 citations), further advancing the frontier of tractable Hamiltonian cycle instances. These contributions are significant because they transform intractable general problems into efficiently solvable special cases, offering practical tools for real-world navigation and layout optimization. Her research continues to bridge theoretical graph algorithms with applied robotics and automation.
Research Focus
Key Achievements
Top Papers
- 1
- 2