M. Alambardar Meybodi

Orcid: 0000-0003-2089-0250

According to our database1, M. Alambardar Meybodi authored at least 14 papers between 2016 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
k-Efficient domination: Algorithmic perspective.
Discret. Math. Algorithms Appl., 2022

Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees.
Proceedings of the IEEE International Conference on Blockchain, 2022

2021
On the k-rainbow domination in graphs with bounded tree-width.
Electron. J. Graph Theory Appl., 2021

W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs.
CoRR, 2021

2020
On the parameterized complexity of [1, <i>j</i>]-domination problems.
Theor. Comput. Sci., 2020

An explicit construction of optimal dominating and [1, 2]-dominating sets in grid.
AKCE Int. J. Graphs Comb., 2020

2019
Domination cover number of graphs.
Discret. Math. Algorithms Appl., 2019

2018
On Mixed Domination in Generalized Petersen Graphs.
CoRR, 2018

A note on belief structures and S-approximation spaces.
CoRR, 2018

On the Parameterized Complexity of [1, j]-Domination Problems.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017
An Explicit Construction of Optimal Dominating Sets in Grid.
CoRR, 2017

2016
Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials.
Int. J. Bifurc. Chaos, 2016

[1, 2]-sets and [1, 2]-total sets in trees with algorithms.
Discret. Appl. Math., 2016

A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces.
CoRR, 2016


  Loading...