default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Alambardar Meybodi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Meysam Rajaati Bavil Olyaei, Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba:
Explicit construction of mixed dominating sets in generalized Petersen graphs. J. Comb. Optim. 48(4): 29 (2024)- 2022
- [j7]Mohsen Alambardar Meybodi
:
k-Efficient domination: Algorithmic perspective. Discret. Math. Algorithms Appl. 14(8): 2250051:1-2250051:13 (2022) - 2021
- [j6]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) - 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]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020) - 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) - 2016
- [j2]Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
[1, 2]-sets and [1, 2]-total sets in trees with algorithms. Discret. Appl. Math. 198: 136-146 (2016) - [j1]Ali Shakiba, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials. Int. J. Bifurc. Chaos 26(7): 1650112:1-1650112:11 (2016)
Conference and Workshop Papers
- 2022
- [c2]Mohsen Alambardar Meybodi, Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Ali Shakiba:
Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees. Blockchain 2022: 266-273 - 2018
- [c1]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS 2018: 34:1-34:14
Informal and Other Publications
- 2024
- [i8]Mohsen Alambardar Meybodi, Abolfazl Poureidi:
On [1, 2]-Domination in Interval and Circle Graphs. CoRR abs/2403.04694 (2024) - 2021
- [i7]Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba:
W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs. CoRR abs/2111.02025 (2021) - 2018
- [i6]M. Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba:
Domination Cover Number of Graphs. CoRR abs/1805.02345 (2018) - [i5]Ali Shakiba, Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Mohsen Alambardar Meybodi:
A note on belief structures and S-approximation spaces. CoRR abs/1805.10672 (2018) - [i4]M. Rajaati, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi, Bijan Davvaz:
On Mixed Domination in Generalized Petersen Graphs. CoRR abs/1812.00977 (2018) - 2017
- [i3]Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Mohsen Alambardar Meybodi:
[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms. CoRR abs/1706.05248 (2017) - [i2]Pouyeh Sharifani, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
An Explicit Construction of Optimal Dominating Sets in Grid. CoRR abs/1707.06471 (2017) - 2016
- [i1]Mohammad Reza Hooshmandasl, M. Alambardar Meybodi, Amir Kafshdar Goharshady, Ali Shakiba:
A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces. CoRR abs/1602.00998 (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-10-22 20:13 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:
