On weakly diamond-free Berge graphs. - Hacène Aït Haddadène; Sylvain Gravier (Discret. Math., 1996)

Coloring perfect degenerate graphs. - Hacène Aït Haddadène; Frédéric Maffray (Discret. Math., 1997)

An algorithm for coloring some perfect graphs. - Hacène Aït Haddadène; Sylvain Gravier; Frédéric Maffray (Discret. Math., 1998)

On the quasi-locally paw-free graphs. - Hacène Aït Haddadène; Meriem Mechebbek (Discret. Math., 2003)

Two bounds of chromatic number in graphs coloring problem. - Assia Gueham; Anass Nagih; Hacène Aït Haddadène (CoDIT, 2014)

Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. - Ahmed Kouider; Hacène Aït Haddadène; Samia Ourari; Ammar Oulamara (CASE, 2015)

On the b-coloring of G-e. - Mohamed Zamime; Mekkia Kouider; Hacène Aït Haddadène (Discret. Appl. Math., 2015)

Splitting a Giant Tour using Integer Linear Programming. - Mouaouia Cherif Bouzid; Hacène Aït Haddadène; Saïd Salhi (Electron. Notes Discret. Math., 2015)

An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. - Mouaouia Cherif Bouzid; Hacène Aït Haddadène; Saïd Salhi (Comput. Oper. Res., 2017)

Mixed graph colouring for unit-time scheduling. - Ahmed Kouider; Hacène Aït Haddadène; Samia Ourari; Ammar Oulamara (Int. J. Prod. Res., 2017)

Graph coloring approach with new upper bounds for the chromatic number: team building application. - Assia Gueham; Anass Nagih; Hacène Aït Haddadène; Malek Masmoudi (RAIRO Oper. Res., 2018)

Contraction-based method for computing a lower bound on the clique number of a graph. - Assia Gueham; Hacène Aït Haddadène; Anass Nagih (CoDIT, 2019)

An extension of adaptive multi-start tabu search for the maximum quasi-clique problem. - Youcef Djeddi; Hacène Aït Haddadène; Nabil Belacel (Comput. Ind. Eng., 2019)

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach. - Ahmed Kouider; Hacène Aït Haddadène (Comput. Oper. Res., 2021)

On P5-free locally split graphs. - Hayat Issaadi; Hacène Aït Haddadène; Hamamache Kheddouci (Discuss. Math. Graph Theory, 2023)

Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach. - Adlane Baaziz; Hacène Aït Haddadène; Ammar Oulamara; Ahmed Kouider (Int. J. Math. Oper. Res., 2023)