On algorithmic complexity of double Roman domination A Poureidi, NJ Rad Discrete Applied Mathematics 285, 539-551, 2020 | 14 | 2020 |

A linear algorithm for double Roman domination of proper interval graphs A Poureidi Discrete Mathematics, Algorithms and Applications 12 (01), 2050011, 2020 | 9 | 2020 |

Total Roman domination for proper interval graphs A Poureidi Electronic Journal of Graph Theory and Applications (EJGTA) 8 (2), 401-413, 2020 | 8 | 2020 |

On the Algorithmic Complexity of Roman -Domination (Italian Domination) A Poureidi, NJ Rad Iranian Journal of Science and Technology, Transactions A: Science 44 (3 …, 2020 | 8 | 2020 |

Graphs with large hop Roman domination number E Shabani, JR Nader, A Poureidi Computer Science Journal of Moldova 79 (1), 3-22, 2019 | 7 | 2019 |

On hop Roman domination in trees NJ Rad, A Poureidi Communications in Combinatorics and Optimization 4 (4), 2019 | 6 | 2019 |

Hop Roman domination in graphs E Shabani, NJ Rad, A Poureidi, A Alhevaz Ars Combin.(to appear), 2017 | 6 | 2017 |

On computing secure domination of trees A Poureidi Discrete Mathematics, Algorithms and Applications 13 (05), 2150055, 2021 | 5 | 2021 |

Algorithmic and complexity aspects of problems related to total Roman domination for graphs A Poureidi, NJ Rad Journal of Combinatorial Optimization 39 (3), 747-763, 2020 | 5 | 2020 |

Algorithmic complexity of triple Roman dominating functions on graphs A Poureidi, J Fathali Communications in Combinatorics and Optimization 9 (2), 217-232, 2024 | 4 | 2024 |

Double Roman domination in graphs: algorithmic complexity A Poureidi Communications in Combinatorics and Optimization 8 (3), 491-503, 2023 | 4 | 2023 |

Algorithm and hardness results in double Roman domination of graphs A Poureidi Theoretical Computer Science 911, 70-79, 2022 | 4 | 2022 |

Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination A Poureidi, M Ghaznavi, J Fathali Journal of Combinatorial Optimization 41, 304-317, 2021 | 3 | 2021 |

On computing the number of (BC-) subtrees, eccentric subtree number, and global and local means of trees A Poureidi Information Processing Letters 178, 106302, 2022 | 2 | 2022 |

Algorithmic aspects of the independent 2-rainbow domination number and independent Roman {2}-domination number A Poureidi, NJ Rad Discussiones Mathematicae Graph Theory 42 (3), 709-726, 2022 | 2 | 2022 |

Algorithmic results in secure total dominating sets on graphs A Poureidi Theoretical Computer Science 918, 1-17, 2022 | 2 | 2022 |

A lower bound for computing geometric spanners M Farshi, A Poureidi Computational Geometry 53, 21-26, 2016 | 2 | 2016 |

Algorithmic results in Roman dominating functions on graphs A Poureidi, J Fathali Information Processing Letters 182, 106363, 2023 | 1 | 2023 |

Efficient algorithms for independent Roman domination on some classes of graphs A Poureidi Communications in Combinatorics and Optimization 8 (1), 127-140, 2023 | 1 | 2023 |

Computing strong Roman domination of trees and unicyclic graphs in linear time A Poureidi, NAA Aziz, NJ Rad, H Kamarulhaili Bulletin of the Malaysian Mathematical Sciences Society 45 (5), 2509-2523, 2022 | 1 | 2022 |