{"id":3505,"date":"2022-04-13T16:34:29","date_gmt":"2022-04-13T14:34:29","guid":{"rendered":"https:\/\/samovar2022.int-evry.fr\/index.php\/acmes-2\/walid-ben-ameur-2\/"},"modified":"2022-04-13T16:34:49","modified_gmt":"2022-04-13T14:34:49","slug":"walid-ben-ameur-2","status":"publish","type":"page","link":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/acmes-2\/walid-ben-ameur-2\/","title":{"rendered":"Walid BEN AMEUR"},"content":{"rendered":"<p><div class=\"bandeau-personnel MonLaboUser\"><img decoding=\"async\" src=\"https:\/\/samovar.telecom-sudparis.eu\/wp-content\/uploads\/2022\/08\/Walid-BENAMEUR.jpg\" class=\"wp-image-6 alignleft img-arrondi wp-post-image\" height=\"150\" width=\"150\" alt=\" \" \/><div class=\"adresse\"><p>SAMOVAR - SAMOVAR<br \/>Telecom SudParis<br \/>\r\n9 rue Charles Fourier<br \/>\r\n91011 EVRY CEDEX<\/p><p>Fax : +33 (0) 1 60 76 20 80<\/p><\/div><div class=\"monlaboBlocTexte\"><h1>Pr. Walid <span class=\"MonLabo-lastname\">BEN AMEUR<\/span><\/h1><div class=\"coordonnees\"><em>Professeur<\/em><br \/><span class=\"team-description\"><a href=\"https:\/\/samovar.telecom-sudparis.eu\/?page_id=4729\" class=\"MonLaboLink\"><span class=\"MonLabo_team_name\">SOP<\/span><\/a><\/span><\/div><div class=\"coordonnees\"><span class=\"MonLabo-email\">walid.benameur[&#64;<span>-Code to remove to avoid SPAM-<\/span>]telecom-sudparis.eu<\/span><\/div><div class=\"external_url\"><h1 style=\"text-align: center;\"><a href=\"https:\/\/sites.google.com\/view\/walid-benameur\"><button class=\"btn btn-oldstyle\" type=\"button\">Site personnel<\/button><\/a><\/h1><\/div><\/div><\/div>\n<div id=\"res_script\">\n<p class='Rubrique'>Article dans une revue<\/p>\n<p class='SousRubrique'>2026<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed. Admission control and pricing for multi-tenant network slices in 5G: a learning perspective. <i>Computer Networks<\/i>, 2026, 276, pp.111949. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.comnet.2025.111949\">&#x27E8;10.1016\/j.comnet.2025.111949&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05466139v1\">&#x27E8;hal-05466139&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05466139\/file\/Resource_Allocation_5G__Computer_Networks_-3%20%281%29.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05466139\/file\/Resource_Allocation_5G__Computer_Networks_-3%20%281%29.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05466139\/file\/Resource_Allocation_5G__Computer_Networks_-3%20%281%29.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05466139v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2025<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Alessandro Maddaloni. Complexity results for a cops and robber game on directed graphs. <i>Networks<\/i>, 2025, 86 (2), pp.144-156. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.22284\">&#x27E8;10.1002\/net.22284&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05281113v1\">&#x27E8;hal-05281113&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05281113\/file\/2410.04897v1.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05281113\/file\/2410.04897v1.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05281113\/file\/2410.04897v1.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05281113v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed. An investment framework for continuous time opinion dynamics on networks. <i>IEEE Transactions on Automatic Control<\/i>, 2025, 70 (10), pp.6497-6512. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/TAC.2025.3561099\">&#x27E8;10.1109\/TAC.2025.3561099&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05460087v1\">&#x27E8;hal-05460087&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05460087\/file\/ODSN_Continuous_journal.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05460087\/file\/ODSN_Continuous_journal.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05460087\/file\/ODSN_Continuous_journal.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05460087v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2024<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur. Subset selection and the cone of factor-width- k matrices. <i>SIAM Journal on Optimization<\/i>, 2024, 34 (1), pp.817-843. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1137\/23M1549444\">&#x27E8;10.1137\/23M1549444&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04680824v1\">&#x27E8;hal-04680824&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-04680824v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur. Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. <i>Operations Research Letters<\/i>, 2024, 57, pp.107166. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.orl.2024.107166\">&#x27E8;10.1016\/j.orl.2024.107166&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04680844v1\">&#x27E8;hal-04680844&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-04680844\/file\/final.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04680844\/file\/final.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04680844\/file\/final.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04680844v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Alessandro Maddaloni. A cops and robber game and the meeting time of synchronous directed walks. <i>Networks<\/i>, 2024, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.22234\">&#x27E8;10.1002\/net.22234&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04607550v2\">&#x27E8;hal-04607550v2&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-04607550\/file\/Some_pursuit_evasion_games_on_digraphs-7.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04607550\/file\/Some_pursuit_evasion_games_on_digraphs-7.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04607550\/file\/Some_pursuit_evasion_games_on_digraphs-7.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04607550v2\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2023<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, et al.. A game theoretic framework for distributed computing with dynamic set of agents. <i>Annals of Operations Research<\/i>, 2023, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10479-023-05231-7\">&#x27E8;10.1007\/s10479-023-05231-7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04302615v1\">&#x27E8;hal-04302615&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-04302615\/file\/Blockchain_Sc2_journal_2022-4.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04302615\/file\/Blockchain_Sc2_journal_2022-4.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04302615\/file\/Blockchain_Sc2_journal_2022-4.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04302615v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2022<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Yacine Al\u2010najjar, Walid Ben-Ameur, J\u00e9r\u00e9mie Leguay, Jocelyne Elias. Affine routing for robust network design. <i>Networks<\/i>, 2022, 79 (4), pp.557-579. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.22070\">&#x27E8;10.1002\/net.22070&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03557367v1\">&#x27E8;hal-03557367&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03557367v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, Jos\u00e9 Neto, Dimitri Watel. The no-meet matroid. <i>Discrete Applied Mathematics<\/i>, 2022, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.dam.2022.12.008\">&#x27E8;10.1016\/j.dam.2022.12.008&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03955928v1\">&#x27E8;hal-03955928&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-03955928\/file\/Revision2.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03955928\/file\/Revision2.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03955928\/file\/Revision2.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03955928v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. New bounds for subset selection from conic relaxations. <i>European Journal of Operational Research<\/i>, 2022, 298 (2), pp.425-438. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejor.2021.07.011\">&#x27E8;10.1016\/j.ejor.2021.07.011&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03557321v1\">&#x27E8;hal-03557321&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-03557321\/file\/S0377221721006068.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03557321\/file\/S0377221721006068.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03557321\/file\/S0377221721006068.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03557321v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, et al.. Strategic investments in distributed computing: A stochastic game perspective. <i>Journal of Parallel and Distributed Computing<\/i>, 2022, 169, pp.317-333. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jpdc.2022.07.012\">&#x27E8;10.1016\/j.jpdc.2022.07.012&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-03767272v1\">&#x27E8;hal-03767272&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-03767272\/file\/Dhamal_JPDC_2022_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03767272\/file\/Dhamal_JPDC_2022_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03767272\/file\/Dhamal_JPDC_2022_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03767272v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2021<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Yacine Al-Najjar, Walid Ben-Ameur, J\u00e9r\u00e9mie Leguay. On the approximability of robust network design. <i>Theoretical Computer Science<\/i>, 2021, 860, pp.41-50. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2021.01.026\">&#x27E8;10.1016\/j.tcs.2021.01.026&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03557332v1\">&#x27E8;hal-03557332&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-03557332\/file\/S0304397521000463.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03557332\/file\/S0304397521000463.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03557332\/file\/S0304397521000463.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03557332v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2020<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. A two phase investment game for competitive opinion dynamics in social networks. <i>Information Processing and Management<\/i>, 2020, 57 (2), pp.102064:1-20. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ipm.2019.102064\">&#x27E8;10.1016\/j.ipm.2019.102064&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01924838v3\">&#x27E8;hal-01924838v3&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01924838\/file\/ODSN_Multiphase_IPM.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01924838\/file\/ODSN_Multiphase_IPM.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01924838\/file\/ODSN_Multiphase_IPM.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01924838v3\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2019<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Optimal investment strategies for competing camps in a social network: a broad framework. <i>IEEE Transactions on Network Science and Engineering<\/i>, 2019, 6 (4), pp.628-645. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/TNSE.2018.2864575\">&#x27E8;10.1109\/TNSE.2018.2864575&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01712288v3\">&#x27E8;hal-01712288v3&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01712288\/file\/ODSN_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01712288\/file\/ODSN_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01712288\/file\/ODSN_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01712288v3\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Jos\u00e9 Neto, Walid Ben-Ameur. On fractional cut covers. <i>Discrete Applied Mathematics<\/i>, 2019, 265, pp.168 - 181. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.dam.2019.03.020\">&#x27E8;10.1016\/j.dam.2019.03.020&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02125083v1\">&#x27E8;hal-02125083&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-02125083\/file\/S0166218X19301945.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02125083\/file\/S0166218X19301945.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02125083\/file\/S0166218X19301945.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02125083v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Guanglei Wang, Walid Ben-Ameur, Adam Ouorou. A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. <i>European Journal of Operational Research<\/i>, 2019, 276 (1), pp.28-39. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejor.2018.12.037\">&#x27E8;10.1016\/j.ejor.2018.12.037&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02440722v1\">&#x27E8;hal-02440722&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-02440722\/file\/1806.08871v1.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02440722\/file\/1806.08871v1.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02440722\/file\/1806.08871v1.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02440722v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2018<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Fiber cable network design in tree networks. <i>European Journal of Operational Research<\/i>, 2018, 269 (3), pp.1086 - 1106. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejor.2018.02.034\">&#x27E8;10.1016\/j.ejor.2018.02.034&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01791553v1\">&#x27E8;hal-01791553&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01791553v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy. Design of fiber cable tree FTTH networks. <i>Electronic Notes in Discrete Mathematics<\/i>, 2018, 64, pp.235 - 244. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2018.01.025\">&#x27E8;10.1016\/j.endm.2018.01.025&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01783787v1\">&#x27E8;hal-01783787&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01783787v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. Complete formulations of polytopes related to extensions of assignment matrices. <i>Discrete Optimization<\/i>, 2018, 29, pp.133 - 147. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.disopt.2018.04.002\">&#x27E8;10.1016\/j.disopt.2018.04.002&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01824469v1\">&#x27E8;hal-01824469&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01824469v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. On the most imbalanced orientation of a graph. <i>Journal of Combinatorial Optimization<\/i>, 2018, 36 (2), pp.637-669. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10878-017-0117-1\">&#x27E8;10.1007\/s10878-017-0117-1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01497902v1\">&#x27E8;hal-01497902&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01497902\/file\/on_the_most_imbalanced_orientation_of_a_graph_v3.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01497902\/file\/on_the_most_imbalanced_orientation_of_a_graph_v3.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01497902\/file\/on_the_most_imbalanced_orientation_of_a_graph_v3.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01497902v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz. Multipolar robust optimization. <i>EURO Journal on Computational Optimization<\/i>, 2018, 6 (4), pp.395 - 434. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s13675-017-0092-4\">&#x27E8;10.1007\/s13675-017-0092-4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01823640v1\">&#x27E8;hal-01823640&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01823640\/file\/1604.01813v2.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01823640\/file\/1604.01813v2.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01823640\/file\/1604.01813v2.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01823640v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed Didi Biha. A note on the problem of r disjoint (s,t)-cuts and some related issues. <i>Operations Research Letters<\/i>, 2018, 46, pp.335 - 338. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.orl.2018.03.003\">&#x27E8;10.1016\/j.orl.2018.03.003&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01783782v1\">&#x27E8;hal-01783782&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01783782v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2017<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Adam Ouorou, Guanglei Wang. Convex and concave envelopes: revisited and new perspectives. <i>Operations Research Letters<\/i>, 2017, 45 (5), pp.421 - 426. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.orl.2017.06.008\">&#x27E8;10.1016\/j.orl.2017.06.008&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01662836v1\">&#x27E8;hal-01662836&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01662836v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2016<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed Didi Biha. Extended cuts. <i>Journal of Combinatorial Optimization<\/i>, 2016, 31 (3), pp.1034 - 1044. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10878-014-9808-z\">&#x27E8;10.1007\/s10878-014-9808-z&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01449794v1\">&#x27E8;hal-01449794&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01449794v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Pascal Bianchi, J\u00e9r\u00e9mie Jakubowicz. Robust distributed consensus using total Variation. <i>IEEE Transactions on Automatic Control<\/i>, 2016, 61 (6), pp.1550 - 1564. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/TAC.2015.2471755\">&#x27E8;10.1109\/TAC.2015.2471755&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01259850v1\">&#x27E8;hal-01259850&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01259850v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Guanglei Wang, Walid Ben-Ameur, Jos\u00e9 Neto, Adam Ouorou. Optimal mapping of cloud virtual machines. <i>Electronic Notes in Discrete Mathematics<\/i>, 2016, 52, pp.93 - 100. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2016.03.013\">&#x27E8;10.1016\/j.endm.2016.03.013&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01453255v1\">&#x27E8;hal-01453255&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01453255v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2015<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. Efficient algorithms for the maximum concurrent flow problem. <i>Networks<\/i>, 2015, 65 (1), pp.56 - 67. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.21572\">&#x27E8;10.1002\/net.21572&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01265440v1\">&#x27E8;hal-01265440&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01265440v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed S. A. Mohamed, Jos\u00e9 Neto. The k-separator problem : polyhedra, complexity and approximation results. <i>Journal of Combinatorial Optimization<\/i>, 2015, 29 (1), pp.276 - 307. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10878-014-9753-x\">&#x27E8;10.1007\/s10878-014-9753-x&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01262822v1\">&#x27E8;hal-01262822&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01262822v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache. A bottleneck-free tree-based name resolution system for Information-Centric Networking. <i>Computer Networks<\/i>, 2015, 91, pp.341 - 355. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.comnet.2015.08.024\">&#x27E8;10.1016\/j.comnet.2015.08.024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01265441v1\">&#x27E8;hal-01265441&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01265441v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2014<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid. Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems. <i>IEEE Transactions on Signal Processing<\/i>, 2014, 62 (18), pp.4896-4910. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/TSP.2014.2337843\">&#x27E8;10.1109\/TSP.2014.2337843&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/centralesupelec.hal.science\/hal-01085071v1\">&#x27E8;hal-01085071&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/centralesupelec.hal.science\/hal-01085071v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Michal Pioro, Mateusz Zotkiewicz. Fractional routing using pairs of failure-disjoint paths. <i>Discrete Applied Mathematics<\/i>, 2014, 164 (1), pp.47 - 60. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.dam.2011.12.019\">&#x27E8;10.1016\/j.dam.2011.12.019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01263061v1\">&#x27E8;hal-01263061&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01263061v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2013<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. <i>Networks<\/i>, 2013, 61 (4), pp.335-355. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.21487\">&#x27E8;10.1002\/net.21487&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00838401v1\">&#x27E8;hal-00838401&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00838401v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mateusz Zotkiewicz, Walid Ben-Ameur. Volume-oriented routing and its modifications. <i>Telecommunication Systems<\/i>, 2013, 52 (2), pp.935-945. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s11235-011-9602-5\">&#x27E8;10.1007\/s11235-011-9602-5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00807292v1\">&#x27E8;hal-00807292&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00807292v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2012<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed Didi Biha. On the minimum cut separator problem. <i>Networks<\/i>, 2012, 59 (1), pp.30-36. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.20478\">&#x27E8;10.1002\/net.20478&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00679174v1\">&#x27E8;hal-00679174&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00679174v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. A gradient-based randomised heuristic for the maximum cut problem. <i>International Journal of Mathematics in Operational Research<\/i>, 2012, 4 (3), pp.276-293. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1504\/12.46688\">&#x27E8;10.1504\/12.46688&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00702709v1\">&#x27E8;hal-00702709&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00702709v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Enhancing Broadcast Vehicular Communications Using Beamforming Technique. <i>International Workshop on Vehicular Communications and Networking (VECON)<\/i>, 2012, pp.565. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00761075v1\">&#x27E8;hal-00761075&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-00761075\/file\/p565-soua.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-00761075\/file\/p565-soua.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-00761075\/file\/p565-soua.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-00761075v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2011<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mateusz Zotkiewicz. Robust routing and optimal partitioning of a traffic demand polytope. <i>International Transactions in Operational Research<\/i>, 2011, 18 (3), pp.307-333. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1111\/j.1475-3995.2010.00764.x\">&#x27E8;10.1111\/j.1475-3995.2010.00764.x&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00678809v1\">&#x27E8;hal-00678809&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00678809v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. <i>Discrete Applied Mathematics<\/i>, 2011, 159 (16), pp.1689-1698. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.dam.2010.08.028\">&#x27E8;10.1016\/j.dam.2010.08.028&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00679017v1\">&#x27E8;hal-00679017&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00679017v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache. Virtual network provisioning across multiple substrate networks. <i>Computer Networks<\/i>, 2011, 55 (4), pp.1011 - 1023. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.comnet.2010.12.011\">&#x27E8;10.1016\/j.comnet.2010.12.011&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01354751v1\">&#x27E8;hal-01354751&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01354751v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2010<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. Spectral bounds for unconstrained (\u22121,1)-quadratic optimization problems. <i>European Journal of Operational Research<\/i>, 2010, 207 (1), pp.15-24. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejor.2010.02.042\">&#x27E8;10.1016\/j.ejor.2010.02.042&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00565883v1\">&#x27E8;hal-00565883&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00565883v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed Didi Biha. Algorithms and formulations for the minimum cut separator problem. <i>Electronic Notes in Discrete Mathematics<\/i>, 2010, 36 (1), pp.977-983. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2010.05.124\">&#x27E8;10.1016\/j.endm.2010.05.124&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00528560v1\">&#x27E8;hal-00528560&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00528560v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji. Designing Steiner networks with unicyclic connected components : an easy problem. <i>SIAM Journal on Discrete Mathematics<\/i>, 2010, 24 (4), pp.1541 - 1557. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1137\/090759033\">&#x27E8;10.1137\/090759033&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01308332v1\">&#x27E8;hal-01308332&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01308332v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji. Steiner Networks with unicyclic connected components. <i>Electronic Notes in Discrete Mathematics<\/i>, 2010, 36 (1), pp.969-976. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2010.05.123\">&#x27E8;10.1016\/j.endm.2010.05.123&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00528042v1\">&#x27E8;hal-00528042&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00528042v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Networks with unicyclic connected components and without short cycles. <i>Electronic Notes in Discrete Mathematics<\/i>, 2010, 36 (1), pp.961-968. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2010.05.122\">&#x27E8;10.1016\/j.endm.2010.05.122&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00528556v1\">&#x27E8;hal-00528556&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00528556v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mateusz Zotkiewicz. Polynomial traffic demand polytope partitioning. <i>Electronic Notes in Discrete Mathematics<\/i>, 2010, 36 (1), pp.1113-1120. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2010.05.141\">&#x27E8;10.1016\/j.endm.2010.05.141&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00528041v1\">&#x27E8;hal-00528041&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00528041v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Finding failure-disjoint paths for path diversity protection in communication networks. <i>IEEE Communications Letters<\/i>, 2010, 14 (8), pp.776-778. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LCOMM.2010.08.100653\">&#x27E8;10.1109\/LCOMM.2010.08.100653&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00529524v1\">&#x27E8;hal-00529524&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00529524v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Failure disjoint paths. <i>Electronic Notes in Discrete Mathematics<\/i>, 2010, 36 (1), pp.1105-1112. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2010.05.140\">&#x27E8;10.1016\/j.endm.2010.05.140&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00528050v1\">&#x27E8;hal-00528050&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00528050v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2008<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. A geometric characterization of \"optimality-equivalent\" relaxations. <i>Journal of Global Optimization<\/i>, 2008, 42 (4), pp.533 - 547. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10898-007-9275-5\">&#x27E8;10.1007\/s10898-007-9275-5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01372395v1\">&#x27E8;hal-01372395&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01372395v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. Spectral bounds for the maximum cut problem. <i>Networks<\/i>, 2008, 52 (1), pp.8 - 13. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.20220\">&#x27E8;10.1002\/net.20220&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01326524v1\">&#x27E8;hal-01326524&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01326524v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Communication dans un congr\u00e8s<\/p>\n<p class='SousRubrique'>2025<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni. Hunting a\u00a0rabbit Is hard. <i>The 31st International Computing and Combinatorics Conference (COCOON)<\/i>, Aug 2025, Chengdu, China. pp.165-178, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-981-95-0215-8_13\">&#x27E8;10.1007\/978-981-95-0215-8_13&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05281163v1\">&#x27E8;hal-05281163&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05281163\/file\/2502.15982v1.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05281163\/file\/2502.15982v1.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05281163\/file\/2502.15982v1.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05281163v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2022<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Yacine Al-Najjar, Walid Ben-Ameur, J\u00e9r\u00e9mie Leguay. Approximability of robust network design: the directed case. <i>The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)<\/i>, Mar 2022, Marseille, France. pp.6:1-6:16, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.STACS.2022.6\">&#x27E8;10.4230\/LIPIcs.STACS.2022.6&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03953268v1\">&#x27E8;hal-03953268&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-03953268\/file\/LIPIcs-STACS-2022-6.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03953268\/file\/LIPIcs-STACS-2022-6.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03953268\/file\/LIPIcs-STACS-2022-6.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03953268v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2021<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Lorela Cano, Tijani Chahed. A framework for joint admission control, resource allocation and pricing for network slicing in 5G. <i>GLOBECOM 2021: IEEE Global Communications Conference<\/i>, Dec 2021, Madrid, Spain. pp.1-6, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/GLOBECOM46510.2021.9685847\">&#x27E8;10.1109\/GLOBECOM46510.2021.9685847&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03546908v1\">&#x27E8;hal-03546908&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03546908v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2020<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay. Autour de l'approximabilit\u00e9 du probl\u00e8me de dimensionnement robuste des r\u00e9seaux. <i>ALGOTEL 2020: 22\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, Sep 2020, Lyon, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02795754v1\">&#x27E8;hal-02795754&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-02795754\/file\/algotel.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02795754\/file\/algotel.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02795754\/file\/algotel.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02795754v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2019<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Yacine Al Najjar, Stefano Paris, Jocelyne Elias, Jeremie Leguay, Walid Ben-Ameur. Optimal routing configuration clustering through dynamic programming. <i>ALGOTEL 2019 : 21\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, Jun 2019, Saint Laurent de la Cabrerisse, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02125608v1\">&#x27E8;hal-02125608&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-02125608\/file\/Algotel_2019.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02125608\/file\/Algotel_2019.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02125608\/file\/Algotel_2019.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02125608v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2018<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Fiber cable network design with operations administration & maintenance constraints. <i>ICORES 2018: 7th International Conference on Operations Research and Enterprise Systems<\/i>, Jan 2018, Funchal, Portugal. pp.94 - 105, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.5220\/0006621700940105\">&#x27E8;10.5220\/0006621700940105&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01783830v1\">&#x27E8;hal-01783830&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01783830\/file\/11da930b23a16efc0acc61bb8ff214997350.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01783830\/file\/11da930b23a16efc0acc61bb8ff214997350.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01783830\/file\/11da930b23a16efc0acc61bb8ff214997350.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01783830v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Manipulating opinion dynamics in social networks in two phases. <i>SocInf+MAISoN 2018: 1st Joint International Workshop on Social Influence Analysis and Mining Actionable Insights from Social Networks<\/i>, Jul 2018, Stockholm, Sweden. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01800311v3\">&#x27E8;hal-01800311v3&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01800311\/file\/ODSN_Multiphase_SocInf%2BMAISoN_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01800311\/file\/ODSN_Multiphase_SocInf%2BMAISoN_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01800311\/file\/ODSN_Multiphase_SocInf%2BMAISoN_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01800311v3\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Resource allocation polytope games: uniqueness of equilibrium, price of stability, and price of anarchy. <i>AAAI 2018: 32nd Conference on Artificial Intelligence<\/i>, Feb 2018, New Orleans, United States. pp.997-1006. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01712284v2\">&#x27E8;hal-01712284v2&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01712284\/file\/ODSN_nash_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01712284\/file\/ODSN_nash_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01712284\/file\/ODSN_nash_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01712284v2\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Optimal multiphase investment strategies for influencing opinions in a social network. <i>AAMAS 2018: 17th international conference on Autonomous Agents and Multiagent Systems<\/i>, Jul 2018, Stockholm, Sweden. pp.1927-1929, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.5555\/3237383.3238026\">&#x27E8;10.5555\/3237383.3238026&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01716062v2\">&#x27E8;hal-01716062v2&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01716062\/file\/Dhamal_Multiphase_short_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01716062\/file\/Dhamal_Multiphase_short_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01716062\/file\/Dhamal_Multiphase_short_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01716062v2\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2016<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Cables network design optimization for the Fiber To The Home. <i>DRCN 2016 : 12th International Conference on the Design of Reliable Communication Networks <\/i>, Mar 2016, Paris, France. pp.87 - 94, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/DRCN.2016.7470839\">&#x27E8;10.1109\/DRCN.2016.7470839&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01450509v1\">&#x27E8;hal-01450509&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01450509v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix. <i>ISCO 2016 : 4th International Symposium on Combinatorial Optimization<\/i>, May 2016, Vietri Sul Mare, Italy. pp.13-25, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-45587-7_2\">&#x27E8;10.1007\/978-3-319-45587-7_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01497880v1\">&#x27E8;hal-01497880&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01497880\/file\/polyhedral_study-v4.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01497880\/file\/polyhedral_study-v4.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01497880\/file\/polyhedral_study-v4.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01497880v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. From graph orientation to the unweighted maximum cut. <i>COCOON 2016 : 22nd International Conference on Computing and Combinatorics<\/i>, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-42634-1_30\">&#x27E8;10.1007\/978-3-319-42634-1_30&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01497887v1\">&#x27E8;hal-01497887&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01497887\/file\/from_graph_orientation_to_the_unweighted_maximum%20cut_problem_v2.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01497887\/file\/from_graph_orientation_to_the_unweighted_maximum%20cut_problem_v2.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01497887\/file\/from_graph_orientation_to_the_unweighted_maximum%20cut_problem_v2.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01497887v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai. How to win elections. <i>COLLABORATECOM 2016 : 12th International Conference on Collaborative Computing: Networking, Applications and Worksharing<\/i>, Nov 2016, Beijing, China. pp.221 - 230, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-59288-6_20\">&#x27E8;10.1007\/978-3-319-59288-6_20&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01710851v1\">&#x27E8;hal-01710851&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01710851v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2015<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. On the most imbalanced orientation of a graph. <i>COCOON 2015 : 21st International Conference on Computing and Combinatorics<\/i>, Aug 2015, Beijing, China. pp.16 - 29, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-21398-9_2\">&#x27E8;10.1007\/978-3-319-21398-9_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01497825v1\">&#x27E8;hal-01497825&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01497825\/file\/on_the_most_imbalanced_orientation_of_a_graph.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01497825\/file\/on_the_most_imbalanced_orientation_of_a_graph.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01497825\/file\/on_the_most_imbalanced_orientation_of_a_graph.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01497825v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Zeineb Hraiech, Fatma Abdelkefi, Mohamed Siala, Walid Ben-Ameur. Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G systems. <i>VTC Spring 2015 : 81st Vehicular Technology Conference<\/i>, May 2015, Glascow, United Kingdom. pp.1 - 6, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/VTCSpring.2015.7145741\">&#x27E8;10.1109\/VTCSpring.2015.7145741&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01265526v1\">&#x27E8;hal-01265526&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01265526v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2013<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid. An interval assignment problem for resource optimization in LTE networks. <i>INOC '13 : International Network Optimization Conference<\/i>, May 2013, Tenerife, Spain. pp.237-244, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2013.05.098\">&#x27E8;10.1016\/j.endm.2013.05.098&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00838466v1\">&#x27E8;hal-00838466&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00838466v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow. <i>INOC '13 : International Network Optimization Conference<\/i>, May 2013, Tenerife, Spain. pp.311-318, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2013.05.107\">&#x27E8;10.1016\/j.endm.2013.05.107&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00838566v1\">&#x27E8;hal-00838566&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00838566v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed S. A. Mohamed, Jos\u00e9 Neto. The k-separator problem. <i>COCOON '13 : 19th International Computing & Combinatorics Conference<\/i>, Jun 2013, Hangzhou, China. pp.337-348, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-38768-5_31\">&#x27E8;10.1007\/978-3-642-38768-5_31&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00843860v1\">&#x27E8;hal-00843860&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00843860v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mateusz Zotkiewicz. Multipolar routing : where dynamic and static routing meet. <i>INOC '13 : International Network Optimization Conference<\/i>, May 2013, Tenerife, Spain. pp.61-68, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.endm.2013.05.076\">&#x27E8;10.1016\/j.endm.2013.05.076&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00838434v1\">&#x27E8;hal-00838434&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00838434v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Pascal Bianchi, J\u00e9r\u00e9mie Jakubowicz. A total variation based approach for robust consensus in distributed networks. <i>CDC 2013 : 52nd IEEE Conference on Decision and Control<\/i>, Dec 2013, Firenze, Italy. pp.1690 - 1695, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/CDC.2013.6760125\">&#x27E8;10.1109\/CDC.2013.6760125&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01269693v1\">&#x27E8;hal-01269693&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01269693v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Pascal Bianchi, J\u00e9r\u00e9mie Jakubowicz. R\u00e9gularisation TV pour le consensus robuste dans les syst\u00e8mes distribu\u00e9s. <i>XXIV\u00e8me Colloque Gretsi<\/i>, Sep 2013, Brest, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00867213v1\">&#x27E8;hal-00867213&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00867213v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Amira Bradai, Walid Ben-Ameur, Hossam Afifi. Byzantine-resistant reputation-based trust management. <i>COLLABORATECOM 2013 : 9th IEEE International Conference on Collaborative Computing : Networking, Applications and Worksharing<\/i>, Oct 2013, Austin, United States. pp.269 - 278, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4108\/icst.collaboratecom.2013.254048\">&#x27E8;10.4108\/icst.collaboratecom.2013.254048&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01261638v1\">&#x27E8;hal-01261638&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01261638v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. <i>WONS 2013 : The 10th Annual Conference on Wireless On-Demand Network Systems and Services<\/i>, Mar 2013, Banff, Canada. pp.107 - 109, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/WONS.2013.6578330\">&#x27E8;10.1109\/WONS.2013.6578330&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00865275v1\">&#x27E8;hal-00865275&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-00865275\/file\/paper_wons.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-00865275\/file\/paper_wons.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-00865275\/file\/paper_wons.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-00865275v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2012<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. An efficient tree-based model for multicommodity flow problems. <i>ISCO '12 : 2nd international symposium on combinatorial optimization<\/i>, Apr 2012, Athens, Greece. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00833882v1\">&#x27E8;hal-00833882&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00833882v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Pascal Bianchi, J\u00e9r\u00e9mie Jakubowicz. Robust average consensus using total variation gossip algorithm. <i>ValueTools '12 : 6th International Conference on Performance Evaluation Methodologies and Tools<\/i>, Oct 2012, Carg\u00e8se, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4108\/valuetools.2012.250316\">&#x27E8;10.4108\/valuetools.2012.250316&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00755020v1\">&#x27E8;hal-00755020&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00755020v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks. <i>Wireless and Mobile Networking Conference (WMNC)<\/i>, Sep 2012, Bratislava, Slovakia. pp.48-53. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00761069v1\">&#x27E8;hal-00761069&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-00761069\/file\/wmnc2012_submission_18.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-00761069\/file\/wmnc2012_submission_18.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-00761069\/file\/wmnc2012_submission_18.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-00761069v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Analysis of information relay processing in Inter-vehicle communication : a novel visit. <i>WiMob '12 : The 8th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications<\/i>, Oct 2012, Barcelone, Spain. pp.157 -164, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/WiMOB.2012.6379069\">&#x27E8;10.1109\/WiMOB.2012.6379069&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00766603v1\">&#x27E8;hal-00766603&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-00766603\/file\/wimob2012.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-00766603\/file\/wimob2012.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-00766603\/file\/wimob2012.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-00766603v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2011<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. Cache location in tree networks : preliminary results. <i>INOC '11 : International Network Optimization Conference<\/i>, Jun 2011, Hamburg, Germany. pp.517-522, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-21527-8_56\">&#x27E8;10.1007\/978-3-642-21527-8_56&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00840387v1\">&#x27E8;hal-00840387&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00840387v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2010<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Pablo Pav\u00f3n Mari\u00f1o, Michal Pioro. On traffic domination in communication networks. <i>Performance Evaluation of Computer and Communication Systems (PERFORM)<\/i>, Oct 2010, Vienne, Austria. pp.191-202, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-25575-5_16\">&#x27E8;10.1007\/978-3-642-25575-5_16&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01301879v1\">&#x27E8;hal-01301879&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01301879\/file\/978-3-642-25575-5_16_Chapter.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01301879\/file\/978-3-642-25575-5_16_Chapter.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01301879\/file\/978-3-642-25575-5_16_Chapter.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01301879v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2009<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Mohamed Didi Biha. The cut separator problem. <i>INOC 2009 : International Network Optimization Conference<\/i>, Apr 2009, Pisa, Italy. pp.1 - 5. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01367479v1\">&#x27E8;hal-01367479&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01367479v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Networks with unicyclic connected components. <i>INOC 2009 : International Network Optimization Conference<\/i>, Apr 2009, Pisa, Italy. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01369244v1\">&#x27E8;hal-01369244&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01369244v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Jos\u00e9 Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. <i>CTW 2009 : 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization<\/i>, Jun 2009, Paris, France. pp.105 - 108. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01368385v1\">&#x27E8;hal-01368385&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-01368385\/file\/ctw09-proceedings-1.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-01368385\/file\/ctw09-proceedings-1.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-01368385\/file\/ctw09-proceedings-1.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-01368385v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mateusz Zotkiewicz, Walid Ben-Ameur. Adding dynamism to robust stable routing. <i>PTS 2009 : 16th Polish Teletraffic Symposium 2009 <\/i>, Sep 2009, \u0141\u00f3d\u017a, Poland. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01360280v1\">&#x27E8;hal-01360280&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01360280v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mateusz Zotkiewicz, Walid Ben-Ameur. More adaptive robust stable routing. <i>GLOBECOM 2009 : IEEE Global Communications Conference<\/i>, Nov 2009, Hawaii, United States. pp.1 - 6, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/GLOCOM.2009.5425958\">&#x27E8;10.1109\/GLOCOM.2009.5425958&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01368408v1\">&#x27E8;hal-01368408&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01368408v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2008<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. R\u00e9sultats pr\u00e9liminaires sur les graphes \u00e0 composantes connexes unicycliques. <i>Roadef 2008 : 9\u00e8me congr\u00e9s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision<\/i>, Feb 2008, Clermont-Ferrand, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01380276v1\">&#x27E8;hal-01380276&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01380276v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. On unicyclic graphs with a lower bounded girth. <i>ECCO XXI : European Chapter on Combinatorial Optimization<\/i>, May 2008, Dubrovnik, Croatia. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01378749v1\">&#x27E8;hal-01378749&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01378749v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Sur le partitionnement des graphes en composantes unicycliques avec contraintes. <i>JPOC5 : Journ\u00e9es Poly\u00e8dres et Optimisation Combinatoire<\/i>, Jun 2008, Rouen, Paris, France. pp.50 - 51. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01374120v1\">&#x27E8;hal-01374120&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01374120v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi. A novel route guidance algorithm with maximum coverage and minimum handover for vehicular networks. <i>ICN 2008 : 7th International Conference on Networking<\/i>, Apr 2008, Cancun, Mexico. pp.692 - 697, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/ICN.2008.31\">&#x27E8;10.1109\/ICN.2008.31&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01373696v1\">&#x27E8;hal-01373696&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01373696v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Chapitre d'ouvrage<\/p>\n<p class='SousRubrique'>2011<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Adam Ouorou, Mateusz Zotkiewicz. Robust routing in communication networks. <i>Progress in combinatorial optimization<\/i>, Iste; Wiley, pp.353 - 390, 2011, 978-1-848-21206-0. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01279133v1\">&#x27E8;hal-01279133&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01279133v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2010<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Walid Ben-Ameur, Ali Ridha Mahjoub, Jos\u00e9 Neto. The maximum cut problem. <i>Paradigms of combinatorial optimization : problems and new approaches, volume 2<\/i>, Iste; Wiley, pp.131 - 172, 2010, 978-1-84821-148-3. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/9781118600207.ch6\">&#x27E8;10.1002\/9781118600207.ch6&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01314806v1\">&#x27E8;hal-01314806&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01314806v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Poster de conf\u00e9rence<\/p>\n<p class='SousRubrique'>2017<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. A Zero-sum Game for Opinion Dynamics in a Social Network with Competing Camps. <i>13th European Meeting on Game Theory (SING13)<\/i>, Jul 2017, Paris, France. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01716712v1\">&#x27E8;hal-01716712&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/inria.hal.science\/hal-01716712v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. A Framework for Optimal Investment Strategies for Competing Camps in a Social Network. <i>PGMO Days 2017 \u2013 Gaspard Monge Program For Optimization, Operations Research and their Interactions with Data Sciences<\/i>, Nov 2017, Paris, France. pp.1, 2017. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01712293v1\">&#x27E8;hal-01712293&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01712293\/file\/pgmodays2017_dhamal.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01712293\/file\/pgmodays2017_dhamal.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01712293\/file\/pgmodays2017_dhamal.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01712293v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>Pr\u00e9-publication, Document de travail<\/p>\n<p class='SousRubrique'>2019<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, et al.. A stochastic game framework for analyzing computational investment strategies in distributed computing. 2019. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01870871v5\">&#x27E8;hal-01870871v5&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/inria.hal.science\/hal-01870871\/file\/Blockchain_HAL.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01870871\/file\/Blockchain_HAL.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01870871\/file\/Blockchain_HAL.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01870871v5\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<\/div>\n<\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":4,"featured_media":4316,"parent":2438,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ocean_post_layout":"","ocean_both_sidebars_style":"","ocean_both_sidebars_content_width":0,"ocean_both_sidebars_sidebars_width":0,"ocean_sidebar":"0","ocean_second_sidebar":"0","ocean_disable_margins":"enable","ocean_add_body_class":"","ocean_shortcode_before_top_bar":"","ocean_shortcode_after_top_bar":"","ocean_shortcode_before_header":"","ocean_shortcode_after_header":"","ocean_has_shortcode":"","ocean_shortcode_after_title":"","ocean_shortcode_before_footer_widgets":"","ocean_shortcode_after_footer_widgets":"","ocean_shortcode_before_footer_bottom":"","ocean_shortcode_after_footer_bottom":"","ocean_display_top_bar":"default","ocean_display_header":"default","ocean_header_style":"","ocean_center_header_left_menu":"0","ocean_custom_header_template":"0","ocean_custom_logo":0,"ocean_custom_retina_logo":0,"ocean_custom_logo_max_width":0,"ocean_custom_logo_tablet_max_width":0,"ocean_custom_logo_mobile_max_width":0,"ocean_custom_logo_max_height":0,"ocean_custom_logo_tablet_max_height":0,"ocean_custom_logo_mobile_max_height":0,"ocean_header_custom_menu":"0","ocean_menu_typo_font_family":"0","ocean_menu_typo_font_subset":"","ocean_menu_typo_font_size":0,"ocean_menu_typo_font_size_tablet":0,"ocean_menu_typo_font_size_mobile":0,"ocean_menu_typo_font_size_unit":"px","ocean_menu_typo_font_weight":"","ocean_menu_typo_font_weight_tablet":"","ocean_menu_typo_font_weight_mobile":"","ocean_menu_typo_transform":"","ocean_menu_typo_transform_tablet":"","ocean_menu_typo_transform_mobile":"","ocean_menu_typo_line_height":0,"ocean_menu_typo_line_height_tablet":0,"ocean_menu_typo_line_height_mobile":0,"ocean_menu_typo_line_height_unit":"","ocean_menu_typo_spacing":0,"ocean_menu_typo_spacing_tablet":0,"ocean_menu_typo_spacing_mobile":0,"ocean_menu_typo_spacing_unit":"","ocean_menu_link_color":"","ocean_menu_link_color_hover":"","ocean_menu_link_color_active":"","ocean_menu_link_background":"","ocean_menu_link_hover_background":"","ocean_menu_link_active_background":"","ocean_menu_social_links_bg":"","ocean_menu_social_hover_links_bg":"","ocean_menu_social_links_color":"","ocean_menu_social_hover_links_color":"","ocean_disable_title":"default","ocean_disable_heading":"default","ocean_post_title":"","ocean_post_subheading":"","ocean_post_title_style":"","ocean_post_title_background_color":"","ocean_post_title_background":0,"ocean_post_title_bg_image_position":"","ocean_post_title_bg_image_attachment":"","ocean_post_title_bg_image_repeat":"","ocean_post_title_bg_image_size":"","ocean_post_title_height":0,"ocean_post_title_bg_overlay":0.5,"ocean_post_title_bg_overlay_color":"","ocean_disable_breadcrumbs":"default","ocean_breadcrumbs_color":"","ocean_breadcrumbs_separator_color":"","ocean_breadcrumbs_links_color":"","ocean_breadcrumbs_links_hover_color":"","ocean_display_footer_widgets":"default","ocean_display_footer_bottom":"default","ocean_custom_footer_template":"0","footnotes":""},"class_list":["post-3505","page","type-page","status-publish","has-post-thumbnail","hentry","entry","has-media"],"_links":{"self":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3505","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/comments?post=3505"}],"version-history":[{"count":1,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3505\/revisions"}],"predecessor-version":[{"id":3506,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3505\/revisions\/3506"}],"up":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/2438"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media\/4316"}],"wp:attachment":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media?parent=3505"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}