| 2008 |
|---|
| 35 | EE | Mustapha Bouchakour,
T. M. Contenza,
C. W. Lee,
Ali Ridha Mahjoub:
On the dominating set polytope.
Eur. J. Comb. 29(3): 652-661 (2008) |
| 2007 |
|---|
| 34 | EE | David Huygens,
Martine Labbé,
Ali Ridha Mahjoub,
Pierre Pesneau:
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
Networks 49(1): 116-133 (2007) |
| 33 | EE | David Huygens,
Ali Ridha Mahjoub:
Integer programming formulations for the two 4-hop-constrained paths problem.
Networks 49(2): 135-144 (2007) |
| 32 | EE | Denis Cornaz,
Ali Ridha Mahjoub:
The Maximum Induced Bipartite Subgraph Problem with Edge Weights.
SIAM J. Discrete Math. 21(3): 662-675 (2007) |
| 2006 |
|---|
| 31 | EE | Pierre Fouilhoux,
Ali Ridha Mahjoub:
Polyhedral results for the bipartite induced subgraph problem.
Discrete Applied Mathematics 154(15): 2128-2149 (2006) |
| 30 | EE | Ali Ridha Mahjoub,
J. Mailfert:
On the independent dominating set polytope.
Eur. J. Comb. 27(4): 601-616 (2006) |
| 29 | EE | Bernard Fortz,
Ali Ridha Mahjoub,
S. Thomas McCormick,
Pierre Pesneau:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program. 105(1): 85-111 (2006) |
| 28 | EE | Jean Fonlupt,
Ali Ridha Mahjoub:
Critical extreme points of the 2-edge connected spanning subgraph polytope.
Math. Program. 105(2-3): 289-310 (2006) |
| 27 | EE | Geir Dahl,
David Huygens,
Ali Ridha Mahjoub,
Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope.
Oper. Res. Lett. 34(5): 577-582 (2006) |
| 2005 |
|---|
| 26 | EE | Hervé Kerivin,
Ali Ridha Mahjoub:
On survivable network polyhedra.
Discrete Mathematics 290(2/3): 183-210 (2005) |
| 25 | EE | Hervé Kerivin,
Ali Ridha Mahjoub:
Design of Survivable Networks: A survey.
Networks 46(1): 1-21 (2005) |
| 2004 |
|---|
| 24 | EE | David Huygens,
Ali Ridha Mahjoub,
Pierre Pesneau:
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra.
SIAM J. Discrete Math. 18(2): 287-312 (2004) |
| 2002 |
|---|
| 23 | | F. Bendali,
Ali Ridha Mahjoub,
J. Mailfert:
Composition of Graphs and the Triangle-Free Subgraph Polytope.
J. Comb. Optim. 6(4): 359-381 (2002) |
| 22 | EE | Hervé Kerivin,
Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem.
Oper. Res. Lett. 30(4): 265-268 (2002) |
| 2001 |
|---|
| 21 | | Mohamed Didi Biha,
Hervé Kerivin,
Ali Ridha Mahjoub:
Steiner trees and polyhedra.
Discrete Applied Mathematics 112(1-3): 101-120 (2001) |
| 2000 |
|---|
| 20 | EE | F. Bendali,
Ali Ridha Mahjoub,
J. Mailfert:
Composition of graphs and the triangle free subgraph polytope.
Electronic Notes in Discrete Mathematics 5: 19-22 (2000) |
| 19 | EE | Ali Ridha Mahjoub,
Pierre Pesneau:
On Steiner 2-edge connected polytopes.
Electronic Notes in Discrete Mathematics 5: 210-213 (2000) |
| 18 | | Mohamed Didi Biha,
Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra.
J. Comb. Optim. 4(1): 131-144 (2000) |
| 17 | EE | Mourad Baïou,
Francisco Barahona,
Ali Ridha Mahjoub:
Separation of Partition Inequalities.
Math. Oper. Res. 25(2): 243-254 (2000) |
| 1999 |
|---|
| 16 | EE | Jean Fonlupt,
Ali Ridha Mahjoub:
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.
IPCO 1999: 166-182 |
| 15 | EE | Ali Ridha Mahjoub,
Charles Nocq:
On the Linear Relaxation of the 2-node Connected Subgraph Polytope.
Discrete Applied Mathematics 95(1-3): 389-416 (1999) |
| 1997 |
|---|
| 14 | EE | Mustapha Bouchakour,
Ali Ridha Mahjoub:
One-node cutsets and the dominating set polytope.
Discrete Mathematics 165-166: 101-123 (1997) |
| 13 | EE | Ali Ridha Mahjoub:
On perfectly two-edge connected graphs.
Discrete Mathematics 170(1-3): 153-172 (1997) |
| 12 | EE | Mourad Baïou,
Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.
SIAM J. Discrete Math. 10(3): 505-514 (1997) |
| 1995 |
|---|
| 11 | EE | Ali Ridha Mahjoub:
A Min-max Relation for K3-covers in Graphs Noncontractible to K5e.
Discrete Applied Mathematics 62(1-3): 209-219 (1995) |
| 10 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
On two-connected subgraph polytopes.
Discrete Mathematics 147(1-3): 19-34 (1995) |
| 1994 |
|---|
| 9 | | Ali Ridha Mahjoub:
Two-edge connected spanning subgraphs and polyhedra.
Math. Program. 64: 199-208 (1994) |
| 8 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.
SIAM J. Discrete Math. 7(3): 344-358 (1994) |
| 7 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra II: Stable Sets.
SIAM J. Discrete Math. 7(3): 359-371 (1994) |
| 6 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor.
SIAM J. Discrete Math. 7(3): 372-389 (1994) |
| 5 | EE | Francisco Barahona,
Jean Fonlupt,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discrete Math. 7(3): 390-402 (1994) |
| 1992 |
|---|
| 4 | | Francisco Barahona,
Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes.
IPCO 1992: 30-43 |
| 3 | EE | Jean Fonlupt,
Ali Ridha Mahjoub,
J. P. Uhry:
Compositions in the bipartite subgraph polytope.
Discrete Mathematics 105(1-3): 73-91 (1992) |
| 1991 |
|---|
| 2 | EE | Reinhardt Euler,
Ali Ridha Mahjoub:
On a composition of independence systems by circuit identification.
J. Comb. Theory, Ser. B 53(2): 235-259 (1991) |
| 1986 |
|---|
| 1 | EE | Michele Conforti,
Derek G. Corneil,
Ali Ridha Mahjoub:
Ki-covers I: Complexity and polytopes.
Discrete Mathematics 58(2): 121-142 (1986) |
