Menu
Cohorets
Computer Sciences
College Name:
Faculty of Basic Science
Educational Group Name:
Computer Sciences
Status:
Active
Room Number:
Email:
Phone:
Journal Articles
- A linear-time approximation algorithm for the minimum-length geometric embedding of trees
- TAYLOR & FRANCIS LTD
- A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
- TAYLOR & FRANCIS LTD
- Finding Hamiltonian Paths between Two Given Vertices in Even-sized T-shaped Grid Graphs
- رايانش نرم و فن اوري اطلاعات=Journal of Soft Computing and Information Technology
- Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
- Applied Mathematics and Computation
- A linear-time algorithm for finding Hamiltonian paths in odd-sized rectangular grid graphs with a L-shaped hole
- علوم رايانشي
- Domination and Independent Domination in Extended Supergrid Graphs
- Multidisciplinary Digital Publishing Institute (MDPI)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle
- Optimization Methods and Software
- The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs
- IAENG International Journal of Computer Science
- Linear-time algorithms for finding Hamiltonian and longest (s,t)-paths in C-shaped grid graphs
- Discrete Optimization
- The Hamiltonian connectivity of alphabet supergrid graphs
- IAENG International Journal of Applied Mathematics
- A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
- Theoretical Computer Science
Conferences Articles
- ارائه مدلي مبتني بر ويژگي هاي زماني براي تشخيص شايعات فارسي در شبكه اجتماعي توييتر
- انجمن علمي انفورماتيك ايران
- A linear-time algorithm for finding Hamiltonian paths in odd-sized L-shaped grid graphs with a rectangular grid hole
- انجمن علمي كامپيوتر
- Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time
- 2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)
- The Hamiltonian path problem in an odd-sized L-shaped grid graphs with a rectangular grid graph
- 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing
- The Hamiltonian path problem in an odd-sized rectangular grid graphs with a L-shaped grid graph
- 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing
- The Hamiltonian path problem in an odd-sized L-shaped grid graphs with a rectangular grid graph
- 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing
- The Hamiltonian path problem in an odd-sized rectangular grid graphs with a L-shaped grid graph
- 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing
- Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time
- 2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)
Thesis
- The Hamiltonian path problem in even-sized T-shaped grid graphs
- 1401/06/14 Fatemeh Keshavarz-Kohjerdi (استاد راهنما 1)
- The Hamiltonian path problem in L-shaped grid graphs with a rectangular hole
- 1400/11/05 Fatemeh Keshavarz-Kohjerdi (استاد راهنما 1)
- The Hamiltonian path problem in odd-sized rectangular grid graphs with a L-shape hole
- 1400/10/28 Fatemeh Keshavarz-Kohjerdi (استاد راهنما 1)