default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohamed Didi Biha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j14]Haeder Y. Althoby, Mohamed Didi Biha, André Sesboüé:
Exact and heuristic methods for the vertex separator problem. Comput. Ind. Eng. 139: 106135 (2020)- 2018
- [j13]Walid Ben-Ameur
, Mohamed Didi Biha:
A note on the problem of r disjoint (s, t)-cuts and some related issues. Oper. Res. Lett. 46(3): 335-338 (2018) - 2016
- [j12]Walid Ben-Ameur, Mohamed Didi Biha:
Extended cuts. J. Comb. Optim. 31(3): 1034-1044 (2016) - 2015
- [j11]Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng:
Polyhedral study of the connected subgraph problem. Discret. Math. 338(1): 80-92 (2015) - 2012
- [j10]Walid Ben-Ameur, Mohamed Didi Biha:
On the minimum cut separator problem. Networks 59(1): 30-36 (2012) - 2011
- [j9]Mohamed Didi Biha, Marie-Jean Meurs:
An exact algorithm for solving the vertex separator problem. J. Glob. Optim. 49(3): 425-434 (2011) - 2010
- [j8]Walid Ben-Ameur, Mohamed Didi Biha:
Algorithms and formulations for the minimum cut separator problem. Electron. Notes Discret. Math. 36: 977-983 (2010) - [j7]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
- [j6]Mireille Palpant, Cristian Oliva, Christian Artigues, Philippe Michelon, Mohamed Didi Biha:
Models and methods for frequency assignment with cumulative interference constraints. Int. Trans. Oper. Res. 15(3): 307-324 (2008) - [j5]Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
On the Polytope of the (1, 2)-Survivable Network Design Problem. SIAM J. Discret. Math. 22(4): 1640-1666 (2008) - 2005
- [j4]Mohamed Didi Biha:
On the 3-Terminal Cut Polyhedron. SIAM J. Discret. Math. 19(3): 575-587 (2005) - 2001
- [j3]Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
Steiner trees and polyhedra. Discret. Appl. Math. 112(1-3): 101-120 (2001) - 2000
- [j2]Mohamed Didi Biha, Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra. J. Comb. Optim. 4(1): 131-144 (2000) - 1996
- [j1]Mohamed Didi Biha, Ali Ridha Mahjoub:
k-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19(2): 71-78 (1996)
Conference and Workshop Papers
- 2007
- [c2]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 - [c1]Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan:
Graph Decomposition Approaches for Terminology Graphs. MICAI 2007: 883-893
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
