Walid Ben-Ameur

105 papers A* 1A 2B 4C 6Misc 3Journal 75Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Admission control and pricing for multi-tenant network slices in 5G: A learning perspective.
Comput. Networks
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed
2026 J jnl
Hunting a rabbit: Complexity, approximability and some characterizations.
Theor. Comput. Sci.
Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni
2025 J jnl
An Investment Framework for Continuous Time Opinion Dynamics on Networks.
IEEE Trans. Autom. Control.
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed
2025 J jnl
Complexity Results for a Cops and Robber Game on Directed Graphs.
Networks
Walid Ben-Ameur, Alessandro Maddaloni
2025 — conf
Hunting a Rabbit Is Hard.
COCOON (1)
Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni
2025 J jnl
Hunting a rabbit is hard.
CoRR
Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni
2024 J jnl
A cops and robber game and the meeting time of synchronous directed walks.
Networks
Walid Ben-Ameur, Alessandro Maddaloni
2024 J jnl
A game theoretic framework for distributed computing with dynamic set of agents.
Ann. Oper. Res.
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary
2024 J jnl
Complexity results for a cops and robber game on directed graphs.
CoRR
Walid Ben-Ameur, Alessandro Maddaloni
2024 J jnl
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope.
Oper. Res. Lett.
Walid Ben-Ameur
2024 J jnl
Subset Selection and the Cone of Factor-Width-
SIAM J. Optim.
Walid Ben-Ameur
2024 J jnl
The no-meet matroid.
Discret. Appl. Math.
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel
2022 J jnl
Affine routing for robust network design.
Networks
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias
2022 A conf
Approximability of Robust Network Design: The Directed Case.
STACS
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay
2022 J jnl
New bounds for subset selection from conic relaxations.
Eur. J. Oper. Res.
Walid Ben-Ameur, José Neto
2022 J jnl
Strategic investments in distributed computing: A stochastic game perspective.
J. Parallel Distributed Comput.
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary
2021 B conf
A framework for joint admission control, resource allocation and pricing for network slicing in 5G.
GLOBECOM
Walid Ben-Ameur, Lorela Cano, Tijani Chahed
2021 J jnl
On the approximability of robust network design.
Theor. Comput. Sci.
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay
2020 J jnl
A two phase investment game for competitive opinion dynamics in social networks.
Inf. Process. Manag.
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2020 J jnl
On the Approximability of Robust Network Design.
CoRR
Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay
2019 J jnl
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines.
Eur. J. Oper. Res.
Guanglei Wang, Walid Ben-Ameur, Adam Ouorou
2019 J jnl
On fractional cut covers.
Discret. Appl. Math.
José Neto, Walid Ben-Ameur
2019 J jnl
Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework.
IEEE Trans. Netw. Sci. Eng.
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2018 J jnl
A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing with Application to Blockchain Mining.
CoRR
Swapnil Dhamal, Tijani Chahed, Walid Ben-Ameur, Eitan Altman, Albert Sunny, Sudheer Poojary
2018 J jnl
A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks.
CoRR
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2018 J jnl
A note on the problem of r disjoint (s, t)-cuts and some related issues.
Oper. Res. Lett.
Walid Ben-Ameur, Mohamed Didi Biha
2018 J jnl
Complete formulations of polytopes related to extensions of assignment matrices.
Discret. Optim.
Walid Ben-Ameur, Antoine Glorieux, José Neto
2018 J jnl
Design of fiber cable tree FTTH networks.
Electron. Notes Discret. Math.
Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy
2018 C conf
Fiber Cable Network Design with Operations Administration & Maintenance Constraints.
ICORES
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
2018 J jnl
Fiber cable network design in tree networks.
Eur. J. Oper. Res.
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
2018 J jnl
Multipolar robust optimization.
EURO J. Comput. Optim.
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz
2018 J jnl
On the most imbalanced orientation of a graph.
J. Comb. Optim.
Walid Ben-Ameur, Antoine Glorieux, José Neto
2018 — conf
Operations Administration and Maintenance Constraints in Fiber Cables Network Design.
ICORES (Selected Papers)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
2018 A conf
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network.
AAMAS
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2018 J jnl
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network.
CoRR
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2018 A* conf
Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy.
AAAI
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2017 J jnl
Convex and concave envelopes: Revisited and new perspectives.
Oper. Res. Lett.
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang
2017 J jnl
Good versus Evil: A Framework for Optimal Investment Strategies for Competing Camps in a Social Network.
CoRR
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
2016 C conf
A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix.
ISCO
Walid Ben-Ameur, Antoine Glorieux, José Neto
2016 — conf
Cables network design optimization for the Fiber To The Home.
DRCN
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
2016 J jnl
Extended cuts.
J. Comb. Optim.
Walid Ben-Ameur, Mohamed Didi Biha
2016 Misc conf
From Graph Orientation to the Unweighted Maximum Cut.
COCOON
Walid Ben-Ameur, Antoine Glorieux, José Neto
2016 C conf
How to Win Elections.
CollaborateCom
Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai
2016 J jnl
Optimal Mapping of Cloud Virtual Machines.
Electron. Notes Discret. Math.
Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou
2016 J jnl
Robust Distributed Consensus Using Total Variation.
IEEE Trans. Autom. Control.
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
2015 J jnl
A bottleneck-free tree-based name resolution system for Information-Centric Networking.
Comput. Networks
Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache
2015 — conf
Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G Systems.
VTC Spring
Zeineb Hraiech, Fatma Abdelkefi, Mohamed Siala, Walid Ben-Ameur
2015 J jnl
Efficient algorithms for the maximum concurrent flow problem.
Networks
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
2015 Misc conf
On the Most Imbalanced Orientation of a Graph.
COCOON
Walid Ben-Ameur, Antoine Glorieux, José Neto
2015 J jnl
The $$k$$ k -separator problem: polyhedra, complexity and approximation results.
J. Comb. Optim.
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
2014 J jnl
Fractional routing using pairs of failure-disjoint paths.
Discret. Appl. Math.
Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz
2014 J jnl
Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems.
IEEE Trans. Signal Process.
Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid
2013 — conf
A Total Variation based approach for robust consensus in distributed networks.
CDC
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
2013 J jnl
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow.
Electron. Notes Discret. Math.
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
2013 J jnl
An Interval Assignment Problem for Resource Optimization in LTE Networks.
Electron. Notes Discret. Math.
Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid
2013 — conf
Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment.
WONS
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
2013 C conf
Byzantine resistant reputation-based trust management.
CollaborateCom
Amira Bradai, Walid Ben-Ameur, Hossam Afifi
2013 J jnl
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth.
Networks
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou
2013 J jnl
Multipolar routing: where dynamic and static routing meet.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Mateusz Zotkiewicz
2013 Misc conf
The
COCOON
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
2013 J jnl
Volume-oriented routing and its modifications.
Telecommun. Syst.
Mateusz Zotkiewicz, Walid Ben-Ameur
2012 J jnl
A gradient-based randomised heuristic for the maximum cut problem.
Int. J. Math. Oper. Res.
Walid Ben-Ameur, José Neto
2012 B conf
Analysis of information relay processing in inter-vehicle communication: A novel visit.
WiMob
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
2012 J jnl
Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks
CoRR
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
2012 — conf
Broadcast-based directional routing in vehicular ad-hoc networks.
WMNC
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
2012 B conf
Enhancing broadcast vehicular communications using beamforming technique.
WiMob
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
2012 J jnl
On the minimum cut separator problem.
Networks
Walid Ben-Ameur, Mohamed Didi Biha
2012 — conf
Robust average consensus using Total Variation Gossip Algorithm.
VALUETOOLS
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
2011 J jnl
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.
Discret. Appl. Math.
Walid Ben-Ameur, José Neto
2011 C conf
Cache Location in Tree Networks: Preliminary Results.
INOC
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
2011 J jnl
Robust routing and optimal partitioning of a traffic demand polytope.
Int. Trans. Oper. Res.
Walid Ben-Ameur, Mateusz Zotkiewicz
2011 J jnl
Virtual network provisioning across multiple substrate networks.
Comput. Networks
Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache
2010 J jnl
Algorithms and formulations for the minimum cut separator problem.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Mohamed Didi Biha
2010 J jnl
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem.
SIAM J. Discret. Math.
Walid Ben-Ameur, Makhlouf Hadji
2010 J jnl
Failure disjoint paths.
Electron. Notes Discret. Math.
Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro
2010 J jnl
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks.
IEEE Commun. Lett.
Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro
2010 J jnl
Networks with unicyclic connected components and without short cycles.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou
2010 — conf
On Traffic Domination in Communication Networks.
PERFORM
Walid Ben-Ameur, Pablo Pavón-Mariño, Michal Pióro
2010 J jnl
Polynomial traffic demand polytope partitioning.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Mateusz Zotkiewicz
2010 J jnl
Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems.
Eur. J. Oper. Res.
Walid Ben-Ameur, José Neto
2010 J jnl
Steiner Networks with unicyclic connected components.
Electron. Notes Discret. Math.
Walid Ben-Ameur, Makhlouf Hadji
2009 C conf
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems.
CTW
Walid Ben-Ameur, José Neto
2009 B conf
More Adaptive Robust Stable Routing.
GLOBECOM
Mateusz Zotkiewicz, Walid Ben-Ameur
2008 — conf
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks.
ICN
Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi
2008 J jnl
A geometric characterization of "optimality-equivalent" relaxations.
J. Glob. Optim.
Walid Ben-Ameur, José Neto
2008 J jnl
Spectral bounds for the maximum cut problem.
Networks
Walid Ben-Ameur, José Neto
2007 J jnl
Acceleration of cutting-plane and column generation algorithms: Applications to network design.
Networks
Walid Ben-Ameur, José Neto
2007 — conf
Between fully dynamic routing and robust stable routing.
DRCN
Walid Ben-Ameur
2007 J jnl
On the minimum cost multiple-source unsplittable flow problem.
RAIRO Oper. Res.
Meriema Belaidouni, Walid Ben-Ameur
2007 J jnl
Preface.
Networks
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
2006 J jnl
A constraint generation algorithm for large scale linear programs using multiple-points separation.
Math. Program.
Walid Ben-Ameur, José Neto
2006 J jnl
Foreword.
Ann. Oper. Res.
Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee
2006 J jnl
Further contributions to network optimization.
Networks
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
2006 J jnl
Mathematical Models of the Delay Constrained Routing Problem.
Algorithmic Oper. Res.
Walid Ben-Ameur, Adam Ouorou
2006 J jnl
New bounds for the maximum cut problem.
Electron. Notes Discret. Math.
Walid Ben-Ameur
2006 — conf
On the Maximum Cut Problem.
ACiD
Walid Ben-Ameur
2004 J jnl
Computing the Initial Temperature of Simulated Annealing.
Comput. Optim. Appl.
Walid Ben-Ameur
2004 — conf
M&M's: an MPLS micro-mobility solution.
ISWCS
Kaouthar Sethom, Hossam Afifi, Walid Ben-Ameur
2004 J jnl
Some recent contributions to network optimization.
Networks
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
2003 J jnl
Internet Routing and Related Topology Issues.
SIAM J. Discret. Math.
Walid Ben-Ameur, Éric Gourdin
2003 J jnl
Networks new economical virtual private.
Commun. ACM
Walid Ben-Ameur, Hervé Kerivin
2002 J jnl
Multi-hour design of survivable classical IP networks.
Int. J. Commun. Syst.
Walid Ben-Ameur
2001 J jnl
Calcul des métriques de routage pour Internet.
Ann. des Télécommunications
Walid Ben-Ameur, Bernard Liau
2001 — conf
Design of Survivible Networks Based on End-to-End Rerouting.
DRCN
Thi Tuyet Loan Pham, Walid Ben-Ameur
2000 J jnl
Constrained length connectivity and survivable networks.
Networks
Walid Ben-Ameur