Efficient Computation of the Degree of Belief for a Subclass of Two Conjuctive Forms. - Guillermo De Ita Luna; Carlos Guillén; Ali Khanafer 001 (LA-NMR, 2009)

New lower bounds for bin packing problems with conflicts. - Ali Khanafer 001; François Clautiaux; El-Ghazali Talbi (Eur. J. Oper. Res., 2010)

The min-conflict packing problem. - Ali Khanafer 001; François Clautiaux; Saïd Hanafi; El-Ghazali Talbi (Comput. Oper. Res., 2012)

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. - Ali Khanafer 001; François Clautiaux; El-Ghazali Talbi (Comput. Oper. Res., 2012)

Lower and upper bounds for the Bin Packing Problem with Fragile Objects. - François Clautiaux; Mauro Dell'Amico; Manuel Iori; Ali Khanafer 001 (Discret. Appl. Math., 2014)