( en | de | ru )

 

Disambiguation of "Biha, Mohamed Didi"

Author of the publication

copydeleteadd this publication to your clipboard
An exact algorithm for solving the vertex separator problem.

, and . J. Glob. Optim., 49 (3): 425-434 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mira Didi

Edith Didi

Didi Surian

Akos Sigmund Bihari

Bhanwarlal Bihani

 

Other publications of authors with the same name

Graph Decomposition Approaches for Terminology Graphs., , , and . MICAI, volume 4827 of Lecture Notes in Computer Science, page 883-893. Springer, (2007)Polyhedral study of the connected subgraph problem., , and . Discret. Math., 338 (1): 80-92 (2015)An exact algorithm for solving the vertex separator problem., and . J. Glob. Optim., 49 (3): 425-434 (2011)Models and methods for frequency assignment with cumulative interference constraints., , , , and . Int. Trans. Oper. Res., 15 (3): 307-324 (2008)Algorithms and formulations for the minimum cut separator problem., and . Electron. Notes Discret. Math., (2010)A note on the problem of r disjoint (s, t)-cuts and some related issues., and . Oper. Res. Lett., 46 (3): 335-338 (2018)On the Polytope of the (1, 2)-Survivable Network Design Problem., , and . SIAM J. Discret. Math., 22 (4): 1640-1666 (2008)Steiner k-Edge Connected Subgraph Polyhedra., and . J. Comb. Optim., 4 (1): 131-144 (2000)On the minimum cut separator problem., and . Networks, 59 (1): 30-36 (2012)On the 3-Terminal Cut Polyhedron.. SIAM J. Discret. Math., 19 (3): 575-587 (2005)