Meriem BENSOUYAD
...
PhD
Univ. Constantine 1
Team : CFSC

Former member
Details
Publications
Meriem Bensouyad; Djamel Eddine Saidouni
A discrete flower pollination algorithm for graph coloring problem. 2nd IEEE Int. Conf. on Cybernetics (CYBCONF'15): 151-155 (2015)
Nousseiba Guidoum; Meriem Bensouyad; Djamel Eddine Saidouni
A new and fast variant of the strict strong coloring based graph distribution algorithm. 16th IEEE/ACIS Int. Conf. on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD'15): 627-631 (2015)
Meriem Bensouyad; Nousseiba Guidoum; Djamel Eddine Saidouni
An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem. Int. J. of Applied Evolutionary Computation (IJAEC) 5(2): 22-36 (2014)
Nousseiba Guidoum; Meriem Bensouyad; Djamel Eddine Saidouni
The Strict Strong Coloring Based Graph Distribution Algorithm. Int. J. of Applied Metaheuristic Computing (IJAMC) 4(1): 50-66 (2013)
Mourad Bouzenada; Meriem Bensouyad; Nousseiba Guidoum; Ahmed Reghioua; Djamel Eddine Saidouni
A Generalized Graph Strict Strong Coloring Algorithm. Int. J. of Applied Metaheuristic Computing (IJAMC) 3(1): 24-33 (2012)
PhD thesis
Meriem Bensouyad
Approches métaheuristiques à base de population pour la coloration de graphes. Université Constantine 2, Algérie (2015)