Pr. Walid BEN AMEUR

Article dans une revue

2023

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. Annals of Operations Research, 2023, ⟨10.1007/s10479-023-05231-7⟩. ⟨hal-04302615⟩

Accès au bibtex

2022

ref_biblio

Yacine Al‐najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias. Affine routing for robust network design. Networks, 2022, 79 (4), pp.557-579. ⟨10.1002/net.22070⟩. ⟨hal-03557367⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel. The no-meet matroid. Discrete Applied Mathematics, 2022, ⟨10.1016/j.dam.2022.12.008⟩. ⟨hal-03955928⟩

Accès au texte intégral et bibtex

ref_biblio

Walid Ben-Ameur, José Neto. New bounds for subset selection from conic relaxations. European Journal of Operational Research, 2022, 298 (2), pp.425-438. ⟨10.1016/j.ejor.2021.07.011⟩. ⟨hal-03557321⟩

Accès au texte intégral et bibtex

ref_biblio

Swapnil Dhamal, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary, et al.. Strategic investments in distributed computing: A stochastic game perspective. Journal of Parallel and Distributed Computing, 2022, 169, pp.317-333. ⟨10.1016/j.jpdc.2022.07.012⟩. ⟨hal-03767272⟩

Accès au texte intégral et bibtex

2021

ref_biblio

Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay. On the approximability of robust network design. Theoretical Computer Science, 2021, 860, pp.41-50. ⟨10.1016/j.tcs.2021.01.026⟩. ⟨hal-03557332⟩

Accès au texte intégral et bibtex

2020

ref_biblio

Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. A two phase investment game for competitive opinion dynamics in social networks. Information Processing and Management, 2020, 57 (2), pp.102064:1-20. ⟨10.1016/j.ipm.2019.102064⟩. ⟨hal-01924838v3⟩

Accès au texte intégral et bibtex

2019

ref_biblio

Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Optimal investment strategies for competing camps in a social network: a broad framework. IEEE Transactions on Network Science and Engineering, 2019, 6 (4), pp.628-645. ⟨10.1109/TNSE.2018.2864575⟩. ⟨hal-01712288v3⟩

Accès au texte intégral et bibtex

ref_biblio

José Neto, Walid Ben-Ameur. On fractional cut covers. Discrete Applied Mathematics, 2019, 265, pp.168 - 181. ⟨10.1016/j.dam.2019.03.020⟩. ⟨hal-02125083⟩

Accès au texte intégral et bibtex

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. European Journal of Operational Research, 2019, 276 (1), pp.28-39. ⟨10.1016/j.ejor.2018.12.037⟩. ⟨hal-02440722⟩

Accès au bibtex

2018

ref_biblio

Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Fiber cable network design in tree networks. European Journal of Operational Research, 2018, 269 (3), pp.1086 - 1106. ⟨10.1016/j.ejor.2018.02.034⟩. ⟨hal-01791553⟩

Accès au bibtex

ref_biblio

Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy. Design of fiber cable tree FTTH networks. Electronic Notes in Discrete Mathematics, 2018, 64, pp.235 - 244. ⟨10.1016/j.endm.2018.01.025⟩. ⟨hal-01783787⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz. Multipolar robust optimization. EURO Journal on Computational Optimization, 2018, 6 (4), pp.395 - 434. ⟨10.1007/s13675-017-0092-4⟩. ⟨hal-01823640⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Antoine Glorieux, José Neto. Complete formulations of polytopes related to extensions of assignment matrices. Discrete Optimization, 2018, 29, pp.133 - 147. ⟨10.1016/j.disopt.2018.04.002⟩. ⟨hal-01824469⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Antoine Glorieux, José Neto. On the most imbalanced orientation of a graph. Journal of Combinatorial Optimization, 2018, 36 (2), pp.637-669. ⟨10.1007/s10878-017-0117-1⟩. ⟨hal-01497902⟩

Accès au texte intégral et bibtex

ref_biblio

Walid Ben-Ameur, Mohamed Didi Biha. A note on the problem of r disjoint (s,t)-cuts and some related issues. Operations Research Letters, 2018, 46, pp.335 - 338. ⟨10.1016/j.orl.2018.03.003⟩. ⟨hal-01783782⟩

Accès au bibtex

2017

ref_biblio

Walid Ben-Ameur, Adam Ouorou, Guanglei Wang. Convex and concave envelopes: revisited and new perspectives. Operations Research Letters, 2017, 45 (5), pp.421 - 426. ⟨10.1016/j.orl.2017.06.008⟩. ⟨hal-01662836⟩

Accès au bibtex

2016

ref_biblio

Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz. Robust distributed consensus using total Variation. IEEE Transactions on Automatic Control, 2016, 61 (6), pp.1550 - 1564. ⟨10.1109/TAC.2015.2471755⟩. ⟨hal-01259850⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mohamed Didi Biha. Extended cuts. Journal of Combinatorial Optimization, 2016, 31 (3), pp.1034 - 1044. ⟨10.1007/s10878-014-9808-z⟩. ⟨hal-01449794⟩

Accès au bibtex

ref_biblio

Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou. Optimal mapping of cloud virtual machines. Electronic Notes in Discrete Mathematics, 2016, 52, pp.93 - 100. ⟨10.1016/j.endm.2016.03.013⟩. ⟨hal-01453255⟩

Accès au bibtex

2015

ref_biblio

Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. Efficient algorithms for the maximum concurrent flow problem. Networks, 2015, 65 (1), pp.56 - 67. ⟨10.1002/net.21572⟩. ⟨hal-01265440⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, José Neto. The k-separator problem : polyhedra, complexity and approximation results. Journal of Combinatorial Optimization, 2015, 29 (1), pp.276 - 307. ⟨10.1007/s10878-014-9753-x⟩. ⟨hal-01262822⟩

Accès au bibtex

ref_biblio

Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache. A bottleneck-free tree-based name resolution system for Information-Centric Networking. Computer Networks, 2015, 91, pp.341 - 355. ⟨10.1016/j.comnet.2015.08.024⟩. ⟨hal-01265441⟩

Accès au bibtex

2014

ref_biblio

Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid. Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems. IEEE Transactions on Signal Processing, 2014, 62 (18), pp.4896-4910. ⟨10.1109/TSP.2014.2337843⟩. ⟨hal-01085071⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Michal Pioro, Mateusz Zotkiewicz. Fractional routing using pairs of failure-disjoint paths. Discrete Applied Mathematics, 2014, 164 (1), pp.47 - 60. ⟨10.1016/j.dam.2011.12.019⟩. ⟨hal-01263061⟩

Accès au bibtex

2013

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks, 2013, 61 (4), pp.335-355. ⟨10.1002/net.21487⟩. ⟨hal-00838401⟩

Accès au bibtex

ref_biblio

Mateusz Zotkiewicz, Walid Ben-Ameur. Volume-oriented routing and its modifications. Telecommunication Systems, 2013, 52 (2), pp.935-945. ⟨10.1007/s11235-011-9602-5⟩. ⟨hal-00807292⟩

Accès au bibtex

2012

ref_biblio

Walid Ben-Ameur, Mohamed Didi Biha. On the minimum cut separator problem. Networks, 2012, 59 (1), pp.30-36. ⟨10.1002/net.20478⟩. ⟨hal-00679174⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, José Neto. A gradient-based randomised heuristic for the maximum cut problem. International Journal of Mathematics in Operational Research, 2012, 4 (3), pp.276-293. ⟨10.1504/12.46688⟩. ⟨hal-00702709⟩

Accès au bibtex

ref_biblio

Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Enhancing Broadcast Vehicular Communications Using Beamforming Technique. International Workshop on Vehicular Communications and Networking (VECON), 2012, pp.565. ⟨hal-00761075⟩

Accès au texte intégral et bibtex

2011

ref_biblio

Walid Ben-Ameur, Mateusz Zotkiewicz. Robust routing and optimal partitioning of a traffic demand polytope. International Transactions in Operational Research, 2011, 18 (3), pp.307-333. ⟨10.1111/j.1475-3995.2010.00764.x⟩. ⟨hal-00678809⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, José Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discrete Applied Mathematics, 2011, 159 (16), pp.1689-1698. ⟨10.1016/j.dam.2010.08.028⟩. ⟨hal-00679017⟩

Accès au bibtex

ref_biblio

Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache. Virtual network provisioning across multiple substrate networks. Computer Networks, 2011, 55 (4), pp.1011 - 1023. ⟨10.1016/j.comnet.2010.12.011⟩. ⟨hal-01354751⟩

Accès au bibtex

2010

ref_biblio

Walid Ben-Ameur, José Neto. Spectral bounds for unconstrained (−1,1)-quadratic optimization problems. European Journal of Operational Research, 2010, 207 (1), pp.15-24. ⟨10.1016/j.ejor.2010.02.042⟩. ⟨hal-00565883⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mohamed Didi Biha. Algorithms and formulations for the minimum cut separator problem. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.977-983. ⟨10.1016/j.endm.2010.05.124⟩. ⟨hal-00528560⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji. Designing Steiner networks with unicyclic connected components : an easy problem. SIAM Journal on Discrete Mathematics, 2010, 24 (4), pp.1541 - 1557. ⟨10.1137/090759033⟩. ⟨hal-01308332⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji. Steiner Networks with unicyclic connected components. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.969-976. ⟨10.1016/j.endm.2010.05.123⟩. ⟨hal-00528042⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mateusz Zotkiewicz. Polynomial traffic demand polytope partitioning. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.1113-1120. ⟨10.1016/j.endm.2010.05.141⟩. ⟨hal-00528041⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Networks with unicyclic connected components and without short cycles. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.961-968. ⟨10.1016/j.endm.2010.05.122⟩. ⟨hal-00528556⟩

Accès au bibtex

ref_biblio

Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Finding failure-disjoint paths for path diversity protection in communication networks. IEEE Communications Letters, 2010, 14 (8), pp.776-778. ⟨10.1109/LCOMM.2010.08.100653⟩. ⟨hal-00529524⟩

Accès au bibtex

ref_biblio

Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Failure disjoint paths. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.1105-1112. ⟨10.1016/j.endm.2010.05.140⟩. ⟨hal-00528050⟩

Accès au bibtex

2008

ref_biblio

Walid Ben-Ameur, José Neto. A geometric characterization of "optimality-equivalent" relaxations. Journal of Global Optimization, 2008, 42 (4), pp.533 - 547. ⟨10.1007/s10898-007-9275-5⟩. ⟨hal-01372395⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, José Neto. Spectral bounds for the maximum cut problem. Networks, 2008, 52 (1), pp.8 - 13. ⟨10.1002/net.20220⟩. ⟨hal-01326524⟩

Accès au bibtex

Communication dans un congrès

2022

ref_biblio

Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay. Approximability of robust network design: the directed case. The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.6:1-6:16, ⟨10.4230/LIPIcs.STACS.2022.6⟩. ⟨hal-03953268⟩

Accès au texte intégral et bibtex

2021

ref_biblio

Walid Ben-Ameur, Lorela Cano, Tijani Chahed. A framework for joint admission control, resource allocation and pricing for network slicing in 5G. GLOBECOM 2021: IEEE Global Communications Conference, Dec 2021, Madrid, Spain. pp.1-6, ⟨10.1109/GLOBECOM46510.2021.9685847⟩. ⟨hal-03546908⟩

Accès au bibtex

2020

ref_biblio

Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay. Autour de l'approximabilité du problème de dimensionnement robuste des réseaux. ALGOTEL 2020: 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. ⟨hal-02795754⟩

Accès au texte intégral et bibtex

2019

ref_biblio

Yacine Al Najjar, Stefano Paris, Jocelyne Elias, Jeremie Leguay, Walid Ben-Ameur. Optimal routing configuration clustering through dynamic programming. ALGOTEL 2019 : 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France. ⟨hal-02125608⟩

Accès au texte intégral et bibtex

2018

ref_biblio

Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Fiber cable network design with operations administration & maintenance constraints. ICORES 2018: 7th International Conference on Operations Research and Enterprise Systems, Jan 2018, Funchal, Portugal. pp.94 - 105, ⟨10.5220/0006621700940105⟩. ⟨hal-01783830⟩

Accès au bibtex

ref_biblio

Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Manipulating opinion dynamics in social networks in two phases. SocInf+MAISoN 2018: 1st Joint International Workshop on Social Influence Analysis and Mining Actionable Insights from Social Networks, Jul 2018, Stockholm, Sweden. ⟨hal-01800311v3⟩

Accès au texte intégral et bibtex

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. AAAI 2018: 32nd Conference on Artificial Intelligence, Feb 2018, New Orleans, United States. pp.997-1006. ⟨hal-01712284v2⟩

Accès au texte intégral et bibtex

ref_biblio

Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. Optimal multiphase investment strategies for influencing opinions in a social network. AAMAS 2018: 17th international conference on Autonomous Agents and Multiagent Systems, Jul 2018, Stockholm, Sweden. pp.1927-1929, ⟨10.5555/3237383.3238026⟩. ⟨hal-01716062v2⟩

Accès au texte intégral et bibtex

2016

ref_biblio

Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur. Cables network design optimization for the Fiber To The Home. DRCN 2016 : 12th International Conference on the Design of Reliable Communication Networks , Mar 2016, Paris, France. pp.87 - 94, ⟨10.1109/DRCN.2016.7470839⟩. ⟨hal-01450509⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Antoine Glorieux, José Neto. From graph orientation to the unweighted maximum cut. COCOON 2016 : 22nd International Conference on Computing and Combinatorics, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007/978-3-319-42634-1_30⟩. ⟨hal-01497887⟩

Accès au texte intégral et bibtex

ref_biblio

Walid Ben-Ameur, Antoine Glorieux, José Neto. A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix. ISCO 2016 : 4th International Symposium on Combinatorial Optimization, May 2016, Vietri Sul Mare, Italy. pp.13-25, ⟨10.1007/978-3-319-45587-7_2⟩. ⟨hal-01497880⟩

Accès au texte intégral et bibtex

ref_biblio

Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai. How to win elections. COLLABORATECOM 2016 : 12th International Conference on Collaborative Computing: Networking, Applications and Worksharing, Nov 2016, Beijing, China. pp.221 - 230, ⟨10.1007/978-3-319-59288-6_20⟩. ⟨hal-01710851⟩

Accès au bibtex

2015

ref_biblio

Walid Ben-Ameur, Antoine Glorieux, José Neto. On the most imbalanced orientation of a graph. COCOON 2015 : 21st International Conference on Computing and Combinatorics, Aug 2015, Beijing, China. pp.16 - 29, ⟨10.1007/978-3-319-21398-9_2⟩. ⟨hal-01497825⟩

Accès au texte intégral et bibtex

ref_biblio

Zeineb Hraiech, Fatma Abdelkefi, Mohamed Siala, Walid Ben-Ameur. Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G systems. VTC Spring 2015 : 81st Vehicular Technology Conference, May 2015, Glascow, United Kingdom. pp.1 - 6, ⟨10.1109/VTCSpring.2015.7145741⟩. ⟨hal-01265526⟩

Accès au bibtex

2013

ref_biblio

Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid. An interval assignment problem for resource optimization in LTE networks. INOC '13 : International Network Optimization Conference, May 2013, Tenerife, Spain. pp.237-244, ⟨10.1016/j.endm.2013.05.098⟩. ⟨hal-00838466⟩

Accès au bibtex

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. INOC '13 : International Network Optimization Conference, May 2013, Tenerife, Spain. pp.311-318, ⟨10.1016/j.endm.2013.05.107⟩. ⟨hal-00838566⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, José Neto. The k-separator problem. COCOON '13 : 19th International Computing & Combinatorics Conference, Jun 2013, Hangzhou, China. pp.337-348, ⟨10.1007/978-3-642-38768-5_31⟩. ⟨hal-00843860⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Mateusz Zotkiewicz. Multipolar routing : where dynamic and static routing meet. INOC '13 : International Network Optimization Conference, May 2013, Tenerife, Spain. pp.61-68, ⟨10.1016/j.endm.2013.05.076⟩. ⟨hal-00838434⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz. A total variation based approach for robust consensus in distributed networks. CDC 2013 : 52nd IEEE Conference on Decision and Control, Dec 2013, Firenze, Italy. pp.1690 - 1695, ⟨10.1109/CDC.2013.6760125⟩. ⟨hal-01269693⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz. Régularisation TV pour le consensus robuste dans les systèmes distribués. XXIVème Colloque Gretsi, Sep 2013, Brest, France. ⟨hal-00867213⟩

Accès au bibtex

ref_biblio

Amira Bradai, Walid Ben-Ameur, Hossam Afifi. Byzantine-resistant reputation-based trust management. COLLABORATECOM 2013 : 9th IEEE International Conference on Collaborative Computing : Networking, Applications and Worksharing, Oct 2013, Austin, United States. pp.269 - 278, ⟨10.4108/icst.collaboratecom.2013.254048⟩. ⟨hal-01261638⟩

Accès au bibtex

ref_biblio

Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. WONS 2013 : The 10th Annual Conference on Wireless On-Demand Network Systems and Services, Mar 2013, Banff, Canada. pp.107 - 109, ⟨10.1109/WONS.2013.6578330⟩. ⟨hal-00865275⟩

Accès au texte intégral et bibtex

2012

ref_biblio

Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. An efficient tree-based model for multicommodity flow problems. ISCO '12 : 2nd international symposium on combinatorial optimization, Apr 2012, Athens, Greece. ⟨hal-00833882⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz. Robust average consensus using total variation gossip algorithm. ValueTools '12 : 6th International Conference on Performance Evaluation Methodologies and Tools, Oct 2012, Cargèse, France. ⟨10.4108/valuetools.2012.250316⟩. ⟨hal-00755020⟩

Accès au bibtex

ref_biblio

Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks. Wireless and Mobile Networking Conference (WMNC), Sep 2012, Bratislava, Slovakia. pp.48-53. ⟨hal-00761069⟩

Accès au texte intégral et bibtex

ref_biblio

Ahmed Soua, Walid Ben-Ameur, Hossam Afifi. Analysis of information relay processing in Inter-vehicle communication : a novel visit. WiMob '12 : The 8th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, Oct 2012, Barcelone, Spain. pp.157 -164, ⟨10.1109/WiMOB.2012.6379069⟩. ⟨hal-00766603⟩

Accès au texte intégral et bibtex

2011

ref_biblio

Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. Cache location in tree networks : preliminary results. INOC '11 : International Network Optimization Conference, Jun 2011, Hamburg, Germany. pp.517-522, ⟨10.1007/978-3-642-21527-8_56⟩. ⟨hal-00840387⟩

Accès au bibtex

2010

ref_biblio

Walid Ben-Ameur, Pablo Pavón Mariño, Michal Pioro. On traffic domination in communication networks. Performance Evaluation of Computer and Communication Systems (PERFORM), Oct 2010, Vienne, Austria. pp.191-202, ⟨10.1007/978-3-642-25575-5_16⟩. ⟨hal-01301879⟩

Accès au texte intégral et bibtex

2009

ref_biblio

Walid Ben-Ameur, Mohamed Didi Biha. The cut separator problem. INOC 2009 : International Network Optimization Conference, Apr 2009, Pisa, Italy. pp.1 - 5. ⟨hal-01367479⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Networks with unicyclic connected components. INOC 2009 : International Network Optimization Conference, Apr 2009, Pisa, Italy. ⟨hal-01369244⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, José Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. CTW 2009 : 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2009, Paris, France. pp.105 - 108. ⟨hal-01368385⟩

Accès au texte intégral et bibtex

ref_biblio

Mateusz Zotkiewicz, Walid Ben-Ameur. Adding dynamism to robust stable routing. PTS 2009 : 16th Polish Teletraffic Symposium 2009 , Sep 2009, Łódź, Poland. ⟨hal-01360280⟩

Accès au bibtex

ref_biblio

Mateusz Zotkiewicz, Walid Ben-Ameur. More adaptive robust stable routing. GLOBECOM 2009 : IEEE Global Communications Conference, Nov 2009, Hawaii, United States. pp.1 - 6, ⟨10.1109/GLOCOM.2009.5425958⟩. ⟨hal-01368408⟩

Accès au bibtex

2008

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Résultats préliminaires sur les graphes à composantes connexes unicycliques. Roadef 2008 : 9ème congrés de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2008, Clermont-Ferrand, France. ⟨hal-01380276⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. On unicyclic graphs with a lower bounded girth. ECCO XXI : European Chapter on Combinatorial Optimization, May 2008, Dubrovnik, Croatia. ⟨hal-01378749⟩

Accès au bibtex

ref_biblio

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Sur le partitionnement des graphes en composantes unicycliques avec contraintes. JPOC5 : Journées Polyèdres et Optimisation Combinatoire, Jun 2008, Rouen, Paris, France. pp.50 - 51. ⟨hal-01374120⟩

Accès au bibtex

ref_biblio

Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi. A novel route guidance algorithm with maximum coverage and minimum handover for vehicular networks. ICN 2008 : 7th International Conference on Networking, Apr 2008, Cancun, Mexico. pp.692 - 697, ⟨10.1109/ICN.2008.31⟩. ⟨hal-01373696⟩

Accès au bibtex

Chapitre d'ouvrage

2011

ref_biblio

Walid Ben-Ameur, Adam Ouorou, Mateusz Zotkiewicz. Robust routing in communication networks. Progress in combinatorial optimization, Iste; Wiley, pp.353 - 390, 2011, 978-1-848-21206-0. ⟨hal-01279133⟩

Accès au bibtex

2010

ref_biblio

Walid Ben-Ameur, Ali Ridha Mahjoub, José Neto. The maximum cut problem. Paradigms of combinatorial optimization : problems and new approaches, volume 2, Iste; Wiley, pp.131 - 172, 2010, 978-1-84821-148-3. ⟨10.1002/9781118600207.ch6⟩. ⟨hal-01314806⟩

Accès au bibtex

Poster de conférence

2017

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. 13th European Meeting on Game Theory (SING13), Jul 2017, Paris, France. ⟨hal-01716712⟩

Accès au bibtex

ref_biblio

Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman. A Framework for Optimal Investment Strategies for Competing Camps in a Social Network. PGMO Days 2017 – Gaspard Monge Program For Optimization, Operations Research and their Interactions with Data Sciences, Nov 2017, Paris, France. pp.1, 2017. ⟨hal-01712293⟩

Accès au texte intégral et bibtex

Pré-publication, Document de travail

2019

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. ⟨hal-01870871v5⟩

Accès au texte intégral et bibtex