Abolfazl Poureidi

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 18

Top Topics

Subgraph Isomorphism

Computational Effort

Graph Theoretic

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Inf. Process. Lett.

Publications

Mohsen Alambardar Meybodi, Abolfazl Poureidi
On [1, 2]-Domination in Interval and Circle Graphs. CoRR (2024)
Abolfazl Poureidi, Mohammad Farshi
On algorithmic complexity of imprecise spanners. Comput. Geom. 117 (2024)
Abolfazl Poureidi, Jafar Fathali
Algorithmic results in Roman dominating functions on graphs. Inf. Process. Lett. 182 (2023)
Abolfazl Poureidi
Counting independent sets in tricyclic graphs. Discret. Appl. Math. 331 (2023)
Abolfazl Poureidi, Mohammad Farshi
Algorithmic results on locating-total domination in graphs. Discret. Appl. Math. 334 (2023)
Abolfazl Poureidi, Nader Jafari Rad
Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number. Discuss. Math. Graph Theory 42 (3) (2022)
Abolfazl Poureidi
Algorithmic results in secure total dominating sets on graphs. Theor. Comput. Sci. 918 (2022)
Abolfazl Poureidi
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees. Inf. Process. Lett. 178 (2022)
Abolfazl Poureidi
Algorithm and hardness results in double Roman domination of graphs. Theor. Comput. Sci. 911 (2022)
Abolfazl Poureidi
On computing secure domination of trees. Discret. Math. Algorithms Appl. 13 (5) (2021)
Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination. J. Comb. Optim. 41 (2) (2021)
Abolfazl Poureidi
A linear algorithm for double Roman domination of proper interval graphs. Discret. Math. Algorithms Appl. 12 (1) (2020)
Abolfazl Poureidi, Nader Jafari Rad
On algorithmic complexity of double Roman domination. Discret. Appl. Math. 285 (2020)
Abolfazl Poureidi
Total Roman domination for proper interval graphs. Electron. J. Graph Theory Appl. 8 (2) (2020)
Abolfazl Poureidi, Nader Jafari Rad
Algorithmic and complexity aspects of problems related to total Roman domination for graphs. J. Comb. Optim. 39 (3) (2020)
Elahe Shabani, Nader Jafari Rad, Abolfazl Poureidi
Graphs with Large Hop Roman Domination Number. Comput. Sci. J. Moldova 27 (1) (2019)
Abolfazl Poureidi, Mohammad Farshi
The well-separated pair decomposition for balls. CoRR (2017)
Mohammad Farshi, Abolfazl Poureidi
A lower bound for computing geometric spanners. Comput. Geom. 53 (2016)