|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
On the minimum cut separator problem.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Didi Biha, Marie-Jean Meurs |
An exact algorithm for solving the vertex separator problem. |
J. Global Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
Algorithms and formulations for the minimum cut separator problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub |
On the Polytope of the (1, 2)-Survivable Network Design Problem. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan |
Graph Decomposition Approaches for Terminology Graphs. |
MICAI |
2007 |
DBLP DOI BibTeX RDF |
polyhedral approach, topic vizualisation, text mining, graph algorithms, graph decomposition |
| 1 | Mohamed Didi Biha |
On the 3-Terminal Cut Polyhedron. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub |
Steiner trees and polyhedra. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Didi Biha, Ali Ridha Mahjoub |
Steiner k-Edge Connected Subgraph Polyhedra. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")