k-edge connected polyhedra on series-parallel graphs. - Mohamed Didi Biha; Ali Ridha Mahjoub (Oper. Res. Lett., 1996)

Steiner k-Edge Connected Subgraph Polyhedra. - Mohamed Didi Biha; Ali Ridha Mahjoub (J. Comb. Optim., 2000)

Steiner trees and polyhedra. - Mohamed Didi Biha; Hervé Kerivin; Ali Ridha Mahjoub (Discret. Appl. Math., 2001)

On the 3-Terminal Cut Polyhedron. - Mohamed Didi Biha (SIAM J. Discret. Math., 2005)

The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. - Fatiha Bendali; Ibrahima Diarrassouba; Mohamed Didi Biha; Ali Ridha Mahjoub; Jean Mailfert (DRCN, 2007)

Graph Decomposition Approaches for Terminology Graphs. - Mohamed Didi Biha; Bangaly Kaba; Marie-Jean Meurs; Eric SanJuan (MICAI, 2007)

Models and methods for frequency assignment with cumulative interference constraints. - Mireille Palpant; Cristian Oliva; Christian Artigues; Philippe Michelon; Mohamed Didi Biha (Int. Trans. Oper. Res., 2008)

On the Polytope of the (1, 2)-Survivable Network Design Problem. - Mohamed Didi Biha; Hervé Kerivin; Ali Ridha Mahjoub (SIAM J. Discret. Math., 2008)

Algorithms and formulations for the minimum cut separator problem. - Walid Ben-Ameur; Mohamed Didi Biha (Electron. Notes Discret. Math., 2010)

A branch-and-cut algorithm for the k-edge connected subgraph problem. - Fatiha Bendali; I. Diarrassouba; Ali Ridha Mahjoub; Mohamed Didi Biha; Jean Mailfert (Networks, 2010)

An exact algorithm for solving the vertex separator problem. - Mohamed Didi Biha; Marie-Jean Meurs (J. Glob. Optim., 2011)

On the minimum cut separator problem. - Walid Ben-Ameur; Mohamed Didi Biha (Networks, 2012)

Polyhedral study of the connected subgraph problem. - Mohamed Didi Biha; Hervé L. M. Kerivin; Peh H. Ng (Discret. Math., 2015)

Extended cuts. - Walid Ben-Ameur; Mohamed Didi Biha (J. Comb. Optim., 2016)

A note on the problem of r disjoint (s, t)-cuts and some related issues. - Walid Ben-Ameur; Mohamed Didi Biha (Oper. Res. Lett., 2018)

Exact and heuristic methods for the vertex separator problem. - Haeder Y. Althoby; Mohamed Didi Biha; André Sesboüé (Comput. Ind. Eng., 2020)