The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ali Ridha Mahjoub: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  30. On the dominating set polytope. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002