Behnaz Omoomi

37 papers Journal 35Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Fostering Peer Learning With a Game-Theoretical Approach in a Blended Learning Environment.
IEEE Trans. Comput. Soc. Syst.
Seyede Fatemeh Noorani, Mohammad Hossein Manshaei, Mohammad Ali Montazeri, Behnaz Omoomi
2021 J jnl
A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees.
Electron. J. Comb.
Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi
2021 J jnl
Star Edge coloring of the Cartesian product of graphs.
Australas. J Comb.
Behnaz Omoomi, Marzieh Vahid Dastjerdi
2019 J jnl
Fostering Peer Learning through a New Game-Theoretical Approach in a Blended Learning Environment.
CoRR
Seyede Fatemeh Noorani, Mohammad Hossein Manshaei, Mohammad Ali Montazeri, Behnaz Omoomi
2018 J jnl
Clique-coloring of Ks
CoRR
Behnaz Omoomi, Maryam Taleb
2018 J jnl
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks.
Int. J. Ad Hoc Ubiquitous Comput.
Ali Ghiasian, Behnaz Omoomi, Hossein Saidi
2017 J jnl
A characterization of some graphs with metric dimension two.
Discret. Math. Algorithms Appl.
Ali Behtoei, Akbar Davoodi, Mohsen Jannesari, Behnaz Omoomi
2016 J jnl
Characterization of Randomly k-Dimensional Graphs.
Ars Comb.
Mohsen Jannesari, Behnaz Omoomi
2016 J jnl
Critical Hamiltonian Connected Graphs.
Ars Comb.
Maliheh Modalleliyan, Behnaz Omoomi
2016 J jnl
Local Clique Covering of Claw-Free Graphs.
J. Graph Theory
Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
2016 J jnl
On incidence coloring for some graphs of maximum degree 4.
Ars Comb.
Hamed Fahimi, Behnaz Omoomi
2016 J jnl
On the Locating Chromatic Number of the Cartesian Product of Graphs.
Ars Comb.
Ali Behtoei, Behnaz Omoomi
2016 J jnl
Pairwise balanced designs and sigma clique partitions.
Discret. Math.
Akbar Davoodi, Ramin Javadi, Behnaz Omoomi
2016 J jnl
Unique basis graphs.
Ars Comb.
Behrooz Bagheri Gh., Mohsen Jannesari, Behnaz Omoomi
2015 — conf
EnHiC: An enforced hill climbing based system for general game playing.
CIG
Amin Babadi, Behnaz Omoomi, Graham Kendall
2015 J jnl
On the 1-2-3-conjecture.
Discret. Math. Theor. Comput. Sci.
Akbar Davoodi, Behnaz Omoomi
2014 J jnl
On the simultaneous edge coloring of graphs.
Discret. Math. Algorithms Appl.
Behrooz Bagheri Gh., Behnaz Omoomi
2013 J jnl
An Upper Bound for the Total Restrained Domination Number of Graphs.
Graphs Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
Max-min total restrained domination number.
Ars Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
On the total restrained domination edge critical graphs.
Ars Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
The impact of network topology on delay bound in wireless Ad Hoc networks.
Wirel. Networks
Ali Ghiasian, Hossein Saidi, Behnaz Omoomi, Soodeh Amiri
2012 J jnl
A generalization of line graphs via link scheduling in wireless networks
CoRR
Ali Ghiasian, Behnaz Omoomi, Hossein Saidi
2012 J jnl
On b-coloring of cartesian product of graphs.
Ars Comb.
Ramin Javadi, Behnaz Omoomi
2012 J jnl
On construction of involutory MDS matrices from Vandermonde Matrices in GF(2 q ).
Des. Codes Cryptogr.
Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Behnaz Omoomi
2012 J jnl
The metric dimension of the lexicographic product of graphs.
Discret. Math.
Mohsen Jannesari, Behnaz Omoomi
2011 J jnl
On randomly k-dimensional graphs.
Appl. Math. Lett.
Mohsen Jannesari, Behnaz Omoomi
2011 J jnl
On the locating chromatic number of Kneser graphs.
Discret. Appl. Math.
Ali Behtoei, Behnaz Omoomi
2009 — conf
A note on the P-time algorithms for solving the maximum independent set problem.
DMO
Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi
2009 J jnl
Constructing regular graphs with smallest defining number.
Ars Comb.
Behnaz Omoomi, Nasrin Soltankhah
2009 J jnl
On b-coloring of the Kneser graphs.
Discret. Math.
Ramin Javadi, Behnaz Omoomi
2008 J jnl
Local coloring of Kneser graphs.
Discret. Math.
Behnaz Omoomi, Ali Pourmiri
2008 J jnl
On the Local Colorings of Graphs.
Ars Comb.
Behnaz Omoomi, Ali Pourmiri
2006 J jnl
On the defining sets of some special graphs.
Australas. J Comb.
Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng
2006 J jnl
Smallest defining number of r-regular k-chromatic graphs: r
Ars Comb.
Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah
2003 J jnl
Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.
Ars Comb.
Behnaz Omoomi, Yee-Hock Peng
2003 J jnl
Chromatic equivalence classes of certain generalized polygon trees, III.
Discret. Math.
Behnaz Omoomi, Yee-Hock Peng
2001 J jnl
Chromatic equivalence classes of certain cycles with edges.
Discret. Math.
Behnaz Omoomi, Yee-Hock Peng