 | 2012 |
|---|
| 9 |       | Walid Ben-Ameur,
Mohamed Didi Biha:
On the minimum cut separator problem.
Networks 59(1): 30-36 (2012) |
| 2011 |
|---|
| 8 | | Mohamed Didi Biha,
Marie-Jean Meurs:
An exact algorithm for solving the vertex separator problem.
J. Global Optimization 49(3): 425-434 (2011) |
| 2010 |
|---|
| 7 | | Walid Ben-Ameur,
Mohamed Didi Biha:
Algorithms and formulations for the minimum cut separator problem.
Electronic Notes in Discrete Mathematics 36: 977-983 (2010) |
| 6 | | Fatiha Bendali,
I. Diarrassouba,
Ali Ridha Mahjoub,
Mohamed Didi Biha,
Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem.
Networks 55(1): 13-32 (2010) |
| 2008 |
|---|
| 5 | | Mohamed Didi Biha,
Hervé Kerivin,
Ali Ridha Mahjoub:
On the Polytope of the (1, 2)-Survivable Network Design Problem.
SIAM J. Discrete Math. 22(4): 1640-1666 (2008) |
| 2007 |
|---|
| 4 | | Mohamed Didi Biha,
Bangaly Kaba,
Marie-Jean Meurs,
Eric SanJuan:
Graph Decomposition Approaches for Terminology Graphs.
MICAI 2007: 883-893 |
| 2005 |
|---|
| 3 | | Mohamed Didi Biha:
On the 3-Terminal Cut Polyhedron.
SIAM J. Discrete Math. 19(3): 575-587 (2005) |
| 2001 |
|---|
| 2 | | Mohamed Didi Biha,
Hervé Kerivin,
Ali Ridha Mahjoub:
Steiner trees and polyhedra.
Discrete Applied Mathematics 112(1-3): 101-120 (2001) |
| 2000 |
|---|
| 1 | | Mohamed Didi Biha,
Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra.
J. Comb. Optim. 4(1): 131-144 (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page