Abolfazl Poureidi

According to our database, Abolfazl Poureidi authored at least 18 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On algorithmic complexity of imprecise spanners.

Abolfazl Poureidi, Mohammad Farshi

Comput. Geom., February, 2024

On [1, 2]-Domination in Interval and Circle Graphs.

Mohsen Alambardar Meybodi, Abolfazl Poureidi

CoRR, 2024

2023

Algorithmic results in Roman dominating functions on graphs.

Abolfazl Poureidi, Jafar Fathali

Inf. Process. Lett., August, 2023

Algorithmic results on locating-total domination in graphs.

Abolfazl Poureidi, Mohammad Farshi

Discret. Appl. Math., July, 2023

Counting independent sets in tricyclic graphs.

Abolfazl Poureidi

Discret. Appl. Math., May, 2023

2022

Algorithmic results in secure total dominating sets on graphs.

Abolfazl Poureidi

Theor. Comput. Sci., 2022

Algorithm and hardness results in double Roman domination of graphs.

Abolfazl Poureidi

Theor. Comput. Sci., 2022

On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees.

Abolfazl Poureidi

Inf. Process. Lett., 2022

Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number.

Abolfazl Poureidi, Nader Jafari Rad

Discuss. Math. Graph Theory, 2022

2021

Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination.

Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali

J. Comb. Optim., 2021

On computing secure domination of trees.

Abolfazl Poureidi

Discret. Math. Algorithms Appl., 2021

2020

Algorithmic and complexity aspects of problems related to total Roman domination for graphs.

Abolfazl Poureidi, Nader Jafari Rad

J. Comb. Optim., 2020

Total Roman domination for proper interval graphs.

Abolfazl Poureidi

Electron. J. Graph Theory Appl., 2020

A linear algorithm for double Roman domination of proper interval graphs.

Abolfazl Poureidi

Discret. Math. Algorithms Appl., 2020

On algorithmic complexity of double Roman domination.

Abolfazl Poureidi, Nader Jafari Rad

Discret. Appl. Math., 2020

2019

Graphs with Large Hop Roman Domination Number.

Elahe Shabani, Nader Jafari Rad, Abolfazl Poureidi

Comput. Sci. J. Moldova, 2019

2017

The well-separated pair decomposition for balls.

Abolfazl Poureidi, Mohammad Farshi

CoRR, 2017

2016

A lower bound for computing geometric spanners.

Mohammad Farshi, Abolfazl Poureidi

Comput. Geom., 2016