default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPouyeh Sharifani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Florent Foucaud
, Narges Ghareghani, Pouyeh Sharifani:
Extremal digraphs for open neighbourhood location-domination and identifying codes. Discret. Appl. Math. 347: 62-74 (2024)- 2023
- [i7]Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani:
Extremal digraphs for open neighbourhood location-domination and identifying codes. CoRR abs/2302.02152 (2023) - 2021
- [j8]Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani:
Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. 302: 76-79 (2021) - [j7]M. Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba:
On the k-rainbow domination in graphs with bounded tree-width. Electron. J. Graph Theory Appl. 9(2): 277-300 (2021) - [j6]Narges Ghareghani, Pouyeh Sharifani:
On square factors and critical factors of k-bonacci words on infinite alphabet. Theor. Comput. Sci. 865: 34-43 (2021) - 2020
- [j5]Pouyeh Sharifani, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
An explicit construction of optimal dominating and [1, 2]-dominating sets in grid. AKCE Int. J. Graphs Comb. 17(3): 870-876 (2020) - [j4]Narges Ghareghani, Morteza Mohammad Noori, Pouyeh Sharifani:
Some Properties of the $k$-bonacci Words on Infinite Alphabet. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2019
- [j3]M. Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba:
Domination cover number of graphs. Discret. Math. Algorithms Appl. 11(2): 1950020:1-1950020:17 (2019) - [j2]Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani:
When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780: 54-65 (2019) - 2018
- [i6]M. Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba:
Domination Cover Number of Graphs. CoRR abs/1805.02345 (2018) - 2017
- [i5]Pouyeh Sharifani, Mohammad Reza Hooshmandasl:
A Linear Algorithm for Computing γ[1,2]-set in Generalized Series-Parallel Graphs. CoRR abs/1707.06443 (2017) - [i4]Pouyeh Sharifani, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
An Explicit Construction of Optimal Dominating Sets in Grid. CoRR abs/1707.06471 (2017) - [i3]Pouyeh Sharifani, Mohammad Reza Hooshmandasl:
Some Results on [1, k]-sets of Lexicographic Products of Graphs. CoRR abs/1708.00219 (2017) - [i2]M. Rajaati, Pouyeh Sharifani, Ali Shakiba, Mohammad Reza Hooshmandasl, Michael J. Dinneen:
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs. CoRR abs/1708.00240 (2017) - 2011
- [j1]Narges Ghareghani, Morteza Mohammad Noori, Pouyeh Sharifani:
On z-factorization and c-factorization of standard episturmian words. Theor. Comput. Sci. 412(39): 5232-5238 (2011) - 2010
- [i1]Morteza Mohammad Noori, Narges Ghareghani, Pouyeh Sharifani:
On z-factorization and c-factorization of standard episturmian words. CoRR abs/1011.5971 (2010)
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 2025-01-09 12:53 CET 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:
