Etude des stables dans les graphes sans étoile. - Najiba Sbihi (1978)

Independence systems with continuous cardinality of bases. - Denis Naddef; Najiba Sbihi; Maurice Tchuenté (Discret. Math., 1980)

Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile. - Najiba Sbihi (Discret. Math., 1980)

A class of h-perfect graphs. - Najiba Sbihi; J. P. Uhry (Discret. Math., 1984)

Bull-free Berge graphs are perfect. - Vasek Chvátal; Najiba Sbihi (Graphs Comb., 1987)

Recognizing claw-free perfect graphs. - Vasek Chvátal; Najiba Sbihi (J. Comb. Theory B, 1988)

Two-colourings that decompose perfect graphs. - Vasek Chvátal; William J. Lenhart; Najiba Sbihi (J. Comb. Theory B, 1990)

Recognizing bull-free perfect graphs. - Bruce A. Reed; Najiba Sbihi (Graphs Comb., 1995)

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. - Ayse Akbalik; Sekoun Kébé; Bernard Penz; Najiba Sbihi (Int. Trans. Oper. Res., 2008)

A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. - Sekoun Kébé; Najiba Sbihi; Bernard Penz (J. Intell. Manuf., 2012)

A discrete time model for storage and scheduling operations in container terminal. - Sanae Kouismi; Loubna Benabbou; Najiba Sbihi (GOL, 2016)

Scheduling unloading operations in a railway terminal. - Sanae Kouismi; Loubna Benabbou; Najiba Sbihi; Bernard Penz (SITA, 2016)