Mohamed Didi Biha

17 papers Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Connected subgraphs, matching, and partitions.
Discret. Math. Algorithms Appl.
Mohamed Didi Biha, Hervé L. M. Kerivin
2020 J jnl
Exact and heuristic methods for the vertex separator problem.
Comput. Ind. Eng.
Haeder Y. Althoby, Mohamed Didi Biha, André Sesboüé
2018 J jnl
A note on the problem of r disjoint (s, t)-cuts and some related issues.
Oper. Res. Lett.
Walid Ben-Ameur, Mohamed Didi Biha
2016 J jnl
Extended cuts.
J. Comb. Optim.
Walid Ben-Ameur, Mohamed Didi Biha
2015 J jnl
Polyhedral study of the connected subgraph problem.
Discret. Math.
Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng
2012 J jnl
On the minimum cut separator problem.
Networks
Walid Ben-Ameur, Mohamed Didi Biha
2011 J jnl
An exact algorithm for solving the vertex separator problem.
J. Glob. Optim.
Mohamed Didi Biha, Marie-Jean Meurs
2010 J jnl
A branch-and-cut algorithm for the
Networks
Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert
2010 J jnl
Algorithms and formulations for the minimum cut separator problem.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Mohamed Didi Biha
2008 J jnl
Models and methods for frequency assignment with cumulative interference constraints.
Int. Trans. Oper. Res.
Mireille Palpant, Cristian Oliva, Christian Artigues, Philippe Michelon, Mohamed Didi Biha
2008 J jnl
On the Polytope of the (1, 2)-Survivable Network Design Problem.
SIAM J. Discret. Math.
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
2007 — conf
Graph Decomposition Approaches for Terminology Graphs.
MICAI
Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan
2007 — conf
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.
DRCN
Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert
2005 J jnl
On the 3-Terminal Cut Polyhedron.
SIAM J. Discret. Math.
Mohamed Didi Biha
2001 J jnl
Steiner trees and polyhedra.
Discret. Appl. Math.
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
2000 J jnl
Steiner k-Edge Connected Subgraph Polyhedra.
J. Comb. Optim.
Mohamed Didi Biha, Ali Ridha Mahjoub
1996 J jnl
k-edge connected polyhedra on series-parallel graphs.
Oper. Res. Lett.
Mohamed Didi Biha, Ali Ridha Mahjoub