Ali Ridha Mahjoub

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jean Fonlupt

> Home > Persons > Ali Ridha Mahjoub

Publications

2006
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/FonluptM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/FonluptM06
Jean Fonlupt, Ali Ridha Mahjoub:
Critical extreme points of the 2-edge connected spanning subgraph polytope. Math. Program. 105(2-3): 289-310 (2006)
1999
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/FonluptM99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/FonluptM99
Jean Fonlupt, Ali Ridha Mahjoub:
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. IPCO 1999: 166-182
1994
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/BarahonaFM94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BarahonaFM94
Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM J. Discret. Math. 7(3): 390-402 (1994)
1992
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/FonluptMU92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/FonluptMU92
Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry:
Compositions in the bipartite subgraph polytope. Discret. Math. 105(1-3): 73-91 (1992)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.