M. I. Moussa

Orcid: 0009-0000-5825-8192

Affiliations:
  • Benha University, Benha, Egypt


According to our database1, M. I. Moussa authored at least 11 papers between 2005 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

2018
Corrigendum to "Two-class support vector machine with new kernel function based on paths of features for predicting chemical activity" [Information Sciences 403-404 (2017) 42-54].
Inf. Sci., 2018

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

2015
Access Control Models for Pervasive Environments: A Survey.
Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics, 2015

2014
Predicting Biological Activity of 2, 4, 6-trisubstituted 1, 3, 5-triazines Using Random Forest.
Proceedings of the Fifth International Conference on Innovations in Bio-Inspired Computing and Applications, 2014

Enhancing Mobile Devices Capabilities in Low Bandwidth Networks with Cloud Computing.
Proceedings of the Advanced Machine Learning Technologies and Applications, 2014

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

An Algorithm for Odd Gracefulness of the Tensor Product of Two Line Graphs
CoRR, 2011

2010
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
CoRR, 2010

2005
Parallel algorithms for the construction of special subgraphs.
PhD thesis, 2005


  Loading...