Behnaz Omoomi
According to our database1,
Behnaz Omoomi
authored at least 37 papers
between 2001 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
Fostering Peer Learning With a Game-Theoretical Approach in a Blended Learning Environment.
IEEE Trans. Comput. Soc. Syst., 2022
2021
Electron. J. Comb., 2021
2019
Fostering Peer Learning through a New Game-Theoretical Approach in a Blended Learning Environment.
CoRR, 2019
2018
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks.
Int. J. Ad Hoc Ubiquitous Comput., 2018
2017
Discret. Math. Algorithms Appl., 2017
2016
Critical Hamiltonian Connected Graphs.
Ars Comb., 2016
Characterization of Randomly k-Dimensional Graphs.
Ars Comb., 2016
Unique basis graphs.
Ars Comb., 2016
On incidence coloring for some graphs of maximum degree 4.
Ars Comb., 2016
On the Locating Chromatic Number of the Cartesian Product of Graphs.
Ars Comb., 2016
2015
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015
2014
2013
Wirel. Networks, 2013
Graphs Comb., 2013
Max-min total restrained domination number.
Ars Comb., 2013
On the total restrained domination edge critical graphs.
Ars Comb., 2013
2012
Des. Codes Cryptogr., 2012
On b-coloring of cartesian product of graphs.
Ars Comb., 2012
2011
2009
Constructing regular graphs with smallest defining number.
Ars Comb., 2009
Proceedings of the 2nd Conference on Data Mining and Optimization, 2009
2008
On the Local Colorings of Graphs.
Ars Comb., 2008
2006
Smallest defining number of r-regular k-chromatic graphs: r <sup>1</sup> k.
Ars Comb., 2006
2003
Discret. Math., 2003
Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.
Ars Comb., 2003
2001