Branch-and-bound and PSO algorithms for no-wait job shop scheduling. - Abdelhakim AitZai; Brahim Benmedjdoub; Mourad Boudhar (J. Intell. Manuf., 2016)

Incidence choosability of graphs. - Brahim Benmedjdoub; Isma Bouchemakh; Éric Sopena (Discret. Appl. Math., 2019)

2-distance colorings of integer distance graphs. - Brahim Benmedjdoub; Isma Bouchemakh; Éric Sopena (Discuss. Math. Graph Theory, 2019)

Strong incidence colouring of graphs. - Brahim Benmedjdoub; Éric Sopena (Discuss. Math. Graph Theory, 2024)