Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

E. M. Badr

Elsayed M. Badr

> Home > Persons

Person information

affiliation: Benha University, Benha, Egypt

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2021
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/complexity/BadrSAA21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/complexity/BadrSAA21
Elsayed M. Badr, Mustafa Abdul Salam, Sultan Almotairi, Hagar Ahmed:
From Linear Programming Approach to Metaheuristic Approach: Scaling Techniques. Complex. 2021: 9384318:1-9384318:10 (2021)
2020
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/BadrAEAA20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/BadrAEAA20
Elsayed M. Badr, Sultan Almotairi, Ashraf Eirokh, Atef Abdel-Hay, Badr Almutairi:
An Integer Linear Programming Model for Solving Radio Mean Labeling Problem. IEEE Access 8: 162343-162349 (2020)
[j4]
- view
  - electronic edition @ jalaxy.com.tw
  - no references & citations available
- export record
  dblp key:
  - journals/ijnsec/MinaamIB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijnsec/MinaamIB20
Diaa Salama Abdul Minaam, Mostafa Abdullah Ibrahim, Elsayed M. Badr:
Chaotic NHCP: Building an Efficient Secure Framework for Cloud Computing Environment Based on Chaos Theory. Int. J. Netw. Secur. 22(2): 283-295 (2020)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/winet/BadrM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/winet/BadrM20
Elsayed M. Badr, Mahmoud I. Moussa:
An upper bound of radio k-coloring problem and its integer linear programming model. Wirel. Networks 26(7): 4955-4964 (2020)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2019
[j2]
- view
  - electronic edition @ kuas.edu.tw (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/jihmsp/MoussaBA19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jihmsp/MoussaBA19
M. I. Moussa, E. M. Badr, Sultan Almotairi:
A Data Hiding Algorithm Based on DNA and Elliptic Curve Cryptosystems. J. Inf. Hiding Multim. Signal Process. 10(3): 458-469 (2019)
2018
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1807-06427
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1807-06427
E. M. Badr, B. Mohamed:
Linear Algebra and Number of Spanning Trees. CoRR abs/1807.06427 (2018)
2016
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/MoussaB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MoussaB16
M. I. Moussa, E. M. Badr:
Ladder and Subdivision of Ladder Graphs with Pendant Edges are Odd Graceful. CoRR abs/1604.02347 (2016)
2011
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcm/BadrMK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/BadrMK11
E. M. Badr, M. I. Moussa, K. Kathiresan:
Crown graphs and subdivision of ladders are odd graceful. Int. J. Comput. Math. 88(17): 3570-3576 (2011)

Coauthor Index

see FAQ

a service of

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.