Meriem Bensouyad

According to our database, Meriem Bensouyad authored at least 5 papers between 2012 and 2015.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2015

A new and fast variant of the strict strong coloring based graph distribution algorithm.

Nousseiba Guidoum, Meriem Bensouyad, Djamel-Eddine Saïdouni

Proceedings of the 16th IEEE/ACIS International Conference on Software Engineering, 2015

A discrete flower pollination algorithm for graph coloring problem.

Meriem Bensouyad, Djamel-Eddine Saïdouni

Proceedings of the 2nd IEEE International Conference on Cybernetics, 2015

2014

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem.

Meriem Bensouyad, Nousseiba Guidoum, Djamel-Eddine Saïdouni

Int. J. Appl. Evol. Comput., 2014

2013

The Strict Strong Coloring Based Graph Distribution Algorithm.

Nousseiba Guidoum, Meriem Bensouyad, Djamel-Eddine Saïdouni

Int. J. Appl. Metaheuristic Comput., 2013

2012

A Generalized Graph Strict Strong Coloring Algorithm.

Mourad Bouzenada, Meriem Bensouyad, Nousseiba Guidoum, Ahmed Reghioua, Djamel-Eddine Saïdouni

Int. J. Appl. Metaheuristic Comput., 2012