E. M. Badr

Orcid: 0000-0002-7666-1169

Affiliations:
  • Benha University, Benha, Egypt


According to our database1, E. M. Badr authored at least 8 papers between 2011 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
From Linear Programming Approach to Metaheuristic Approach: Scaling Techniques.
Complex., 2021

2020
An upper bound of radio k-coloring problem and its integer linear programming model.
Wirel. Networks, 2020

Chaotic NHCP: Building an Efficient Secure Framework for Cloud Computing Environment Based on Chaos Theory.
Int. J. Netw. Secur., 2020

An Integer Linear Programming Model for Solving Radio Mean Labeling Problem.
IEEE Access, 2020

2019
A Data Hiding Algorithm Based on DNA and Elliptic Curve Cryptosystems.
J. Inf. Hiding Multim. Signal Process., 2019

2018
Linear Algebra and Number of Spanning Trees.
CoRR, 2018

2016
Ladder and Subdivision of Ladder Graphs with Pendant Edges are Odd Graceful.
CoRR, 2016

2011
Crown graphs and subdivision of ladders are odd graceful.
Int. J. Comput. Math., 2011


  Loading...