default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbolfazl Poureidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Abolfazl Poureidi, Mohammad Farshi
:
On algorithmic complexity of imprecise spanners. Comput. Geom. 117: 102051 (2024)- [i2]Mohsen Alambardar Meybodi, Abolfazl Poureidi:
On [1, 2]-Domination in Interval and Circle Graphs. CoRR abs/2403.04694 (2024) - 2023
- [j15]Abolfazl Poureidi:
Counting independent sets in tricyclic graphs. Discret. Appl. Math. 331: 138-146 (2023) - [j14]Abolfazl Poureidi, Mohammad Farshi:
Algorithmic results on locating-total domination in graphs. Discret. Appl. Math. 334: 36-44 (2023) - [j13]Abolfazl Poureidi, Jafar Fathali:
Algorithmic results in Roman dominating functions on graphs. Inf. Process. Lett. 182: 106363 (2023) - 2022
- [j12]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): 709-726 (2022) - [j11]Abolfazl Poureidi:
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees. Inf. Process. Lett. 178: 106302 (2022) - [j10]Abolfazl Poureidi:
Algorithm and hardness results in double Roman domination of graphs. Theor. Comput. Sci. 911: 70-79 (2022) - [j9]Abolfazl Poureidi:
Algorithmic results in secure total dominating sets on graphs. Theor. Comput. Sci. 918: 1-17 (2022) - 2021
- [j8]Abolfazl Poureidi:
On computing secure domination of trees. Discret. Math. Algorithms Appl. 13(5): 2150055:1-2150055:15 (2021) - [j7]Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali:
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination. J. Comb. Optim. 41(2): 304-317 (2021) - 2020
- [j6]Abolfazl Poureidi, Nader Jafari Rad:
On algorithmic complexity of double Roman domination. Discret. Appl. Math. 285: 539-551 (2020) - [j5]Abolfazl Poureidi:
A linear algorithm for double Roman domination of proper interval graphs. Discret. Math. Algorithms Appl. 12(1): 2050011:1-2050011:10 (2020) - [j4]Abolfazl Poureidi:
Total Roman domination for proper interval graphs. Electron. J. Graph Theory Appl. 8(2): 401-413 (2020) - [j3]Abolfazl Poureidi, Nader Jafari Rad:
Algorithmic and complexity aspects of problems related to total Roman domination for graphs. J. Comb. Optim. 39(3): 747-763 (2020)
2010 – 2019
- 2019
- [j2]Elahe Shabani, Nader Jafari Rad, Abolfazl Poureidi:
Graphs with Large Hop Roman Domination Number. Comput. Sci. J. Moldova 27(1): 3-22 (2019) - 2017
- [i1]Abolfazl Poureidi, Mohammad Farshi:
The well-separated pair decomposition for balls. CoRR abs/1706.06287 (2017) - 2016
- [j1]Mohammad Farshi, Abolfazl Poureidi:
A lower bound for computing geometric spanners. Comput. Geom. 53: 21-26 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
