default search action
Behnaz Omoomi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j32]Seyede Fatemeh Noorani
, Mohammad Hossein Manshaei
Fostering Peer Learning With a Game-Theoretical Approach in a Blended Learning Environment. IEEE Trans. Comput. Soc. Syst. 9(2): 571-580 (2022) - 2021
- [j31]Behnaz Omoomi, Marzieh Vahid Dastjerdi:
Star Edge coloring of the Cartesian product of graphs. Australas. J Comb. 79: 15-30 (2021) - [j30]Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi:
A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees. Electron. J. Comb. 28(1): 1 (2021)
2010 – 2019
- 2019
- [i3]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 abs/1910.12235 (2019) - 2018
- [j29]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): 69-79 (2018) - [i2]Behnaz Omoomi, Maryam Taleb:
Clique-coloring of Ks3, 3-minor free graphs. CoRR abs/1801.02186 (2018) - 2017
- [j28]Ali Behtoei, Akbar Davoodi
A characterization of some graphs with metric dimension two. Discret. Math. Algorithms Appl. 9(2): 1750027:1-1750027:15 (2017) - 2016
- [j27]Hamed Fahimi, Behnaz Omoomi:
On incidence coloring for some graphs of maximum degree 4. Ars Comb. 125: 33-45 (2016) - [j26]Maliheh Modalleliyan, Behnaz Omoomi:
Critical Hamiltonian Connected Graphs. Ars Comb. 126: 13-27 (2016) - [j25]Ali Behtoei, Behnaz Omoomi:
On the Locating Chromatic Number of the Cartesian Product of Graphs. Ars Comb. 126: 221-235 (2016) - [j24]Mohsen Jannesari, Behnaz Omoomi:
Characterization of Randomly k-Dimensional Graphs. Ars Comb. 127: 357-372 (2016) - [j23]Behrooz Bagheri Gh., Mohsen Jannesari, Behnaz Omoomi:
Unique basis graphs. Ars Comb. 129: 249-259 (2016) - [j22]Akbar Davoodi
Pairwise balanced designs and sigma clique partitions. Discret. Math. 339(5): 1450-1458 (2016) - [j21]Ramin Javadi
Local Clique Covering of Claw-Free Graphs. J. Graph Theory 81(1): 92-104 (2016) - 2015
- [j20]Akbar Davoodi, Behnaz Omoomi:
On the 1-2-3-conjecture. Discret. Math. Theor. Comput. Sci. 17(1): 67-78 (2015) - [c2]Amin Babadi, Behnaz Omoomi, Graham Kendall:
EnHiC: An enforced hill climbing based system for general game playing. CIG 2015: 193-199 - 2014
- [j19]Behrooz Bagheri Gh., Behnaz Omoomi:
On the simultaneous edge coloring of graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - 2013
- [j18]Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
On the total restrained domination edge critical graphs. Ars Comb. 109: 97-112 (2013) - [j17]Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
Max-min total restrained domination number. Ars Comb. 112: 161-174 (2013) - [j16]Khee Meng Koh, Zeinab Maleki
An Upper Bound for the Total Restrained Domination Number of Graphs. Graphs Comb. 29(5): 1443-1452 (2013) - [j15]Ali Ghiasian, Hossein Saidi
The impact of network topology on delay bound in wireless Ad Hoc networks. Wirel. Networks 19(2): 237-245 (2013) - 2012
- [j14]Ramin Javadi, Behnaz Omoomi:
On b-coloring of cartesian product of graphs. Ars Comb. 107: 521-536 (2012) - [j13]Mahdi Sajadieh
On construction of involutory MDS matrices from Vandermonde Matrices in GF(2 q ). Des. Codes Cryptogr. 64(3): 287-308 (2012) - [j12]Mohsen Jannesari, Behnaz Omoomi:
The metric dimension of the lexicographic product of graphs. Discret. Math. 312(22): 3349-3356 (2012) - [i1]Ali Ghiasian, Behnaz Omoomi, Hossein Saidi:
A generalization of line graphs via link scheduling in wireless networks. CoRR abs/1210.7467 (2012) - 2011
- [j11]Mohsen Jannesari, Behnaz Omoomi:
On randomly k-dimensional graphs. Appl. Math. Lett. 24(10): 1625-1629 (2011) - [j10]Ali Behtoei, Behnaz Omoomi:
On the locating chromatic number of Kneser graphs. Discret. Appl. Math. 159(18): 2214-2221 (2011)
2000 – 2009
- 2009
- [j9]Behnaz Omoomi, Nasrin Soltankhah:
Constructing regular graphs with smallest defining number. Ars Comb. 91 (2009) - [j8]Ramin Javadi
On b-coloring of the Kneser graphs. Discret. Math. 309(13): 4399-4408 (2009) - [c1]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: 65-70 - 2008
- [j7]Behnaz Omoomi, Ali Pourmiri:
On the Local Colorings of Graphs. Ars Comb. 86 (2008) - [j6]Behnaz Omoomi, Ali Pourmiri
Local coloring of Kneser graphs. Discret. Math. 308(24): 5922-5927 (2008) - 2006
- [j5]Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng:
On the defining sets of some special graphs. Australas. J Comb. 35: 69-82 (2006) - [j4]Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah:
Smallest defining number of r-regular k-chromatic graphs: r 1 k. Ars Comb. 78 (2006) - 2003
- [j3]Behnaz Omoomi, Yee-Hock Peng:
Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II. Ars Comb. 68 (2003) - [j2]Behnaz Omoomi, Yee-Hock Peng:
Chromatic equivalence classes of certain generalized polygon trees, III. Discret. Math. 271(1-3): 223-234 (2003) - 2001
- [j1]Behnaz Omoomi, Yee-Hock Peng:
Chromatic equivalence classes of certain cycles with edges. Discret. Math. 232(1-3): 175-183 (2001)
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-04-25 05:54 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: