Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mohamed Didi Biha
@article{DBLP:journals/candie/AlthobyBS20,
author = {Haeder Y. Althoby and
Mohamed Didi Biha and
Andr{\'{e}} Sesbo{\"{u}}{\'{e}}},
title = {Exact and heuristic methods for the vertex separator problem},
journal = {Comput. Ind. Eng.},
volume = {139},
pages = {106135},
year = {2020},
url = {https://doi.org/10.1016/j.cie.2019.106135},
doi = {10.1016/J.CIE.2019.106135},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/AlthobyBS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Ben-AmeurB18,
author = {Walid Ben{-}Ameur and
Mohamed Didi Biha},
title = {A note on the problem of r disjoint (s, t)-cuts and some related issues},
journal = {Oper. Res. Lett.},
volume = {46},
number = {3},
pages = {335--338},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.03.003},
doi = {10.1016/J.ORL.2018.03.003},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Ben-AmeurB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ben-AmeurB16,
author = {Walid Ben{-}Ameur and
Mohamed Didi Biha},
title = {Extended cuts},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1034--1044},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9808-z},
doi = {10.1007/S10878-014-9808-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BihaKN15,
author = {Mohamed Didi Biha and
Herv{\'{e}} L. M. Kerivin and
Peh H. Ng},
title = {Polyhedral study of the connected subgraph problem},
journal = {Discret. Math.},
volume = {338},
number = {1},
pages = {80--92},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.08.026},
doi = {10.1016/J.DISC.2014.08.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BihaKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ben-AmeurB12,
author = {Walid Ben{-}Ameur and
Mohamed Didi Biha},
title = {On the minimum cut separator problem},
journal = {Networks},
volume = {59},
number = {1},
pages = {30--36},
year = {2012},
url = {https://doi.org/10.1002/net.20478},
doi = {10.1002/NET.20478},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ben-AmeurB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BihaM11,
author = {Mohamed Didi Biha and
Marie{-}Jean Meurs},
title = {An exact algorithm for solving the vertex separator problem},
journal = {J. Glob. Optim.},
volume = {49},
number = {3},
pages = {425--434},
year = {2011},
url = {https://doi.org/10.1007/s10898-010-9568-y},
doi = {10.1007/S10898-010-9568-Y},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BihaM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Ben-AmeurB10,
author = {Walid Ben{-}Ameur and
Mohamed Didi Biha},
title = {Algorithms and formulations for the minimum cut separator problem},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {977--983},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.124},
doi = {10.1016/J.ENDM.2010.05.124},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Ben-AmeurB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BendaliDMBM10,
author = {Fatiha Bendali and
I. Diarrassouba and
Ali Ridha Mahjoub and
Mohamed Didi Biha and
Jean Mailfert},
title = {A branch-and-cut algorithm for the \emph{k}-edge connected subgraph
problem},
journal = {Networks},
volume = {55},
number = {1},
pages = {13--32},
year = {2010},
url = {https://doi.org/10.1002/net.20310},
doi = {10.1002/NET.20310},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BendaliDMBM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/PalpantOAMB08,
author = {Mireille Palpant and
Cristian Oliva and
Christian Artigues and
Philippe Michelon and
Mohamed Didi Biha},
title = {Models and methods for frequency assignment with cumulative interference
constraints},
journal = {Int. Trans. Oper. Res.},
volume = {15},
number = {3},
pages = {307--324},
year = {2008},
url = {https://doi.org/10.1111/j.1475-3995.2008.00630.x},
doi = {10.1111/J.1475-3995.2008.00630.X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/PalpantOAMB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BihaKM08,
author = {Mohamed Didi Biha and
Herv{\'{e}} Kerivin and
Ali Ridha Mahjoub},
title = {On the Polytope of the (1, 2)-Survivable Network Design Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {4},
pages = {1640--1666},
year = {2008},
url = {https://doi.org/10.1137/050639600},
doi = {10.1137/050639600},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BihaKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/drcn/BendaliDBMM07,
author = {Fatiha Bendali and
Ibrahima Diarrassouba and
Mohamed Didi Biha and
Ali Ridha Mahjoub and
Jean Mailfert},
title = {The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut},
booktitle = {6th International Workshop on Design and Reliable Communication Networks,
{DRCN} 2007, La Rochelle, France, October 7-10, 2007},
pages = {1--8},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/DRCN.2007.4762290},
doi = {10.1109/DRCN.2007.4762290},
timestamp = {Wed, 19 Oct 2022 11:20:21 +0200},
biburl = {https://dblp.org/rec/conf/drcn/BendaliDBMM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/micai/BihaKMS07,
author = {Mohamed Didi Biha and
Bangaly Kaba and
Marie{-}Jean Meurs and
Eric SanJuan},
editor = {Alexander F. Gelbukh and
Angel Fernando Kuri Morales},
title = {Graph Decomposition Approaches for Terminology Graphs},
booktitle = {{MICAI} 2007: Advances in Artificial Intelligence, 6th Mexican International
Conference on Artificial Intelligence, Aguascalientes, Mexico, November
4-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4827},
pages = {883--893},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-76631-5\_84},
doi = {10.1007/978-3-540-76631-5\_84},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/micai/BihaKMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Biha05,
author = {Mohamed Didi Biha},
title = {On the 3-Terminal Cut Polyhedron},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {575--587},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445149},
doi = {10.1137/S0895480104445149},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Biha05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BihaKM01,
author = {Mohamed Didi Biha and
Herv{\'{e}} Kerivin and
Ali Ridha Mahjoub},
title = {Steiner trees and polyhedra},
journal = {Discret. Appl. Math.},
volume = {112},
number = {1-3},
pages = {101--120},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00311-5},
doi = {10.1016/S0166-218X(00)00311-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BihaKM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BihaM00,
author = {Mohamed Didi Biha and
Ali Ridha Mahjoub},
title = {Steiner k-Edge Connected Subgraph Polyhedra},
journal = {J. Comb. Optim.},
volume = {4},
number = {1},
pages = {131--144},
year = {2000},
url = {https://doi.org/10.1023/A:1009893108387},
doi = {10.1023/A:1009893108387},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BihaM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BihaM96,
author = {Mohamed Didi Biha and
Ali Ridha Mahjoub},
title = {k-edge connected polyhedra on series-parallel graphs},
journal = {Oper. Res. Lett.},
volume = {19},
number = {2},
pages = {71--78},
year = {1996},
url = {https://doi.org/10.1016/0167-6377(96)00015-6},
doi = {10.1016/0167-6377(96)00015-6},
timestamp = {Wed, 19 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BihaM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-25 02:35 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:
