Get started
Author

Abolfazl Poureidi

Observed names: A. Poureidi, Poureidi, Abolfazl
ORCID: 0000-0002-2506-0590
Observed ORCID: 0000-0002-2506-0590
OpenAlex ID: A5085912207
On algorithmic complexity of double Roman domination
2020 · Abolfazl Poureidi, Nader Jafari Rad · Discrete Applied Mathematics · 12
On the Algorithmic Complexity of Roman $$\{2\}$$-Domination (Italian Domination)
2020 · Abolfazl Poureidi, Nader Jafari Rad · Iranian Journal of Science and Technology Transactions A Science · 10
Total Roman domination for proper interval graphs
2020 · Abolfazl Poureidi · Electronic Journal of Graph Theory and Applications · 7
PDF
A linear algorithm for double Roman domination of proper interval graphs
2019 · Abolfazl Poureidi · Discrete Mathematics Algorithms and Applications · 6
Algorithm and hardness results in double Roman domination of graphs
2022 · Abolfazl Poureidi · Theoretical Computer Science · 5
On computing secure domination of trees
2020 · Abolfazl Poureidi · Discrete Mathematics Algorithms and Applications · 5
Algorithmic and complexity aspects of problems related to total Roman domination for graphs
2019 · Abolfazl Poureidi, Nader Jafari Rad · Journal of Combinatorial Optimization · 4
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
2022 · Abolfazl Poureidi · Information Processing Letters · 3
Algorithmic Results in Roman Dominating Functions on Graphs
2022 · Abolfazl Poureidi, Jafar Fathali · Information Processing Letters · 3
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
2021 · Abolfazl Poureidi, Mehrdad Ghaznavi, et al. · Journal of Combinatorial Optimization · 3
Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \{2\} -domination number
2020 · Abolfazl Poureidi, Nader Jafari Rad · Discussiones Mathematicae Graph Theory · 3
On Hop Roman Domination in Trees
2019 · N. Jafari Rad, A. Poureidi · DOAJ (DOAJ: Directory of Open Access Journals) · 3
A lower bound for computing geometric spanners
2015 · Mohammad Farshi, Abolfazl Poureidi · Computational Geometry · 3
PDF
Computing Strong Roman Domination of Trees and Unicyclic Graphs in Linear Time
2022 · Abolfazl Poureidi, Noor A’lawiah Abd Aziz, et al. · Bulletin of the Malaysian Mathematical Sciences Society · 2
Algorithmic results in secure total dominating sets on graphs
2022 · Abolfazl Poureidi · Theoretical Computer Science · 2
On the domination number of generalized Petersen graphs
2020 · Abolfazl Poureidi · International Symposium on Algorithms and Computation · 2
Algorithmic results on locating-total domination in graphs
2023 · Abolfazl Poureidi, Mohammad Farshi · Discrete Applied Mathematics · 1
Counting independent sets in tricyclic graphs
2023 · Abolfazl Poureidi · Discrete Applied Mathematics · 1
On computing total double Roman domination number of trees in linear time
2020 · Abolfazl Poureidi · International Symposium on Algorithms and Computation · 1
Graphs with Large Hop Roman Domination Number.
2019 · Elahe Shabani, Nader Jafari Rad, et al. · DOAJ (DOAJ: Directory of Open Access Journals) · 1
On $[1,2]$-Domination in Interval and Circle Graphs
2024 · Mohsen Alambardar Meybodi, Abolfazl Poureidi · Discrete Mathematics & Theoretical Computer Science
PDF
On algorithmic complexity of imprecise spanners
2023 · Abolfazl Poureidi, Mohammad Farshi · Computational Geometry
Efficient algorithms for independent Roman domination on some classes of graphs
2021 · Abolfazl Poureidi · Communications in combinatorics and optimization
Algorithmic Aspects of Roman Graphs
2021 · Abolfazl Poureidi · DOAJ (DOAJ: Directory of Open Access Journals)
The well-separated pair decomposition for balls
2017 · Poureidi, Abolfazl, Farshi, Mohammad · arXiv (Cornell University)
PDF
Works count: 26
Citation count: 77
H-index: 5
I10-index: 2
Year
Topic
Type