Mohamed Didi Biha

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 Fatiha Bendali

> Home > Persons > Mohamed Didi Biha

Publications

2010
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/BendaliDMBM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BendaliDMBM10
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)
2007
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/drcn/BendaliDBMM07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/drcn/BendaliDBMM07
Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert:
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. DRCN 2007: 1-8

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.