Mohamed Didi Biha

According to our database, Mohamed Didi Biha authored at least 16 papers between 1996 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Exact and heuristic methods for the vertex separator problem.

Haeder Y. Althoby, Mohamed Didi Biha, André Sesboüé

Comput. Ind. Eng., 2020

2018

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

2016

Extended cuts.

Walid Ben-Ameur, Mohamed Didi Biha

J. Comb. Optim., 2016

2015

Polyhedral study of the connected subgraph problem.

Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng

Discret. Math., 2015

2012

On the minimum cut separator problem.

Walid Ben-Ameur, Mohamed Didi Biha

Networks, 2012

2011

An exact algorithm for solving the vertex separator problem.

Mohamed Didi Biha, Marie-Jean Meurs

J. Glob. Optim., 2011

2010

A branch-and-cut algorithm for the <i>k</i>-edge connected subgraph problem.

Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert

Networks, 2010

Algorithms and formulations for the minimum cut separator problem.

Walid Ben-Ameur, Mohamed Didi Biha

Electron. Notes Discret. Math., 2010

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

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

2007

Graph Decomposition Approaches for Terminology Graphs.

Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan

Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.

Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2005

On the 3-Terminal Cut Polyhedron.

Mohamed Didi Biha

SIAM J. Discret. Math., 2005

2001

Steiner trees and polyhedra.

Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub

Discret. Appl. Math., 2001

2000

Steiner k-Edge Connected Subgraph Polyhedra.

Mohamed Didi Biha, Ali Ridha Mahjoub

J. Comb. Optim., 2000

1996

k-edge connected polyhedra on series-parallel graphs.

Mohamed Didi Biha, Ali Ridha Mahjoub

Oper. Res. Lett., 1996