Behnaz Omoomi

Publication Activity (10 Years)

Years Active: 2001-2022
Publications (10 Years): 14

Top Topics

Graph Theoretical

Cartesian Product

Enforced Hill Climbing

General Game Playing

Top Venues

Discret. Math. Algorithms Appl.

Publications

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