Constrained length connectivity and survivable networks. - Walid Ben-Ameur (Networks, 2000)

Design of Survivible Networks Based on End-to-End Rerouting. - Thi Tuyet Loan Pham; Walid Ben-Ameur (DRCN, 2001)

Calcul des métriques de routage pour Internet. - Walid Ben-Ameur; Bernard Liau (Ann. des Télécommunications, 2001)

Multi-hour design of survivable classical IP networks. - Walid Ben-Ameur (Int. J. Commun. Syst., 2002)

Networks new economical virtual private. - Walid Ben-Ameur; Hervé Kerivin (Commun. ACM, 2003)

Internet Routing and Related Topology Issues. - Walid Ben-Ameur; Éric Gourdin (SIAM J. Discret. Math., 2003)

M&M's: an MPLS micro-mobility solution. - Kaouthar Sethom; Hossam Afifi; Walid Ben-Ameur (ISWCS, 2004)

Computing the Initial Temperature of Simulated Annealing. - Walid Ben-Ameur (Comput. Optim. Appl., 2004)

Some recent contributions to network optimization. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2004)

On the Maximum Cut Problem. - Walid Ben-Ameur (ACiD, 2006)

Foreword. - Walid Ben-Ameur; Daniel Bienstock; Iraj Saniee (Ann. Oper. Res., 2006)

Mathematical Models of the Delay Constrained Routing Problem. - Walid Ben-Ameur; Adam Ouorou (Algorithmic Oper. Res., 2006)

New bounds for the maximum cut problem. - Walid Ben-Ameur (Electron. Notes Discret. Math., 2006)

A constraint generation algorithm for large scale linear programs using multiple-points separation. - Walid Ben-Ameur; José Neto (Math. Program., 2006)

Further contributions to network optimization. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2006)

Between fully dynamic routing and robust stable routing. - Walid Ben-Ameur (DRCN, 2007)

Preface. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2007)

Acceleration of cutting-plane and column generation algorithms: Applications to network design. - Walid Ben-Ameur; José Neto (Networks, 2007)

On the minimum cost multiple-source unsplittable flow problem. - Meriema Belaidouni; Walid Ben-Ameur (RAIRO Oper. Res., 2007)

A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. - Mohamed Chedly Ghedira; Walid Ben-Ameur; Hossam Afifi (ICN, 2008)

A geometric characterization of "optimality-equivalent" relaxations. - Walid Ben-Ameur; José Neto (J. Glob. Optim., 2008)

Spectral bounds for the maximum cut problem. - Walid Ben-Ameur; José Neto (Networks, 2008)

A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. - Walid Ben-Ameur; José Neto (CTW, 2009)

More Adaptive Robust Stable Routing. - Mateusz Zotkiewicz; Walid Ben-Ameur (GLOBECOM, 2009)

On Traffic Domination in Communication Networks. - Walid Ben-Ameur; Pablo Pavón-Mariño; Michal Pióro (PERFORM, 2010)

Algorithms and formulations for the minimum cut separator problem. - Walid Ben-Ameur; Mohamed Didi Biha (Electron. Notes Discret. Math., 2010)

Steiner Networks with unicyclic connected components. - Walid Ben-Ameur; Makhlouf Hadji (Electron. Notes Discret. Math., 2010)

Networks with unicyclic connected components and without short cycles. - Walid Ben-Ameur; Makhlouf Hadji; Adam Ouorou (Electron. Notes Discret. Math., 2010)

Polynomial traffic demand polytope partitioning. - Walid Ben-Ameur; Mateusz Zotkiewicz (Electron. Notes Discret. Math., 2010)

Failure disjoint paths. - Mateusz Zotkiewicz; Walid Ben-Ameur; Michal Pióro (Electron. Notes Discret. Math., 2010)

Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. - Walid Ben-Ameur; José Neto 001 (Eur. J. Oper. Res., 2010)

Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. - Mateusz Zotkiewicz; Walid Ben-Ameur; Michal Pióro (IEEE Commun. Lett., 2010)

Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. - Walid Ben-Ameur; Makhlouf Hadji (SIAM J. Discret. Math., 2010)

Cache Location in Tree Networks: Preliminary Results. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (INOC, 2011)

Virtual network provisioning across multiple substrate networks. - Ines Houidi; Wajdi Louati; Walid Ben-Ameur; Djamal Zeghlache (Comput. Networks, 2011)

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. - Walid Ben-Ameur; José Neto 001 (Discret. Appl. Math., 2011)

Robust routing and optimal partitioning of a traffic demand polytope. - Walid Ben-Ameur; Mateusz Zotkiewicz (Int. Trans. Oper. Res., 2011)

Broadcast-based directional routing in vehicular ad-hoc networks. - Ahmed Soua; Walid Ben-Ameur; Hossam Afifi (WMNC, 2012)

Robust average consensus using Total Variation Gossip Algorithm. - Walid Ben-Ameur; Pascal Bianchi; Jérémie Jakubowicz (VALUETOOLS, 2012)

Analysis of information relay processing in inter-vehicle communication: A novel visit. - Ahmed Soua; Walid Ben-Ameur; Hossam Afifi (WiMob, 2012)

Enhancing broadcast vehicular communications using beamforming technique. - Ahmed Soua; Walid Ben-Ameur; Hossam Afifi (WiMob, 2012)

A gradient-based randomised heuristic for the maximum cut problem. - Walid Ben-Ameur; José Neto 001 (Int. J. Math. Oper. Res., 2012)

On the minimum cut separator problem. - Walid Ben-Ameur; Mohamed Didi Biha (Networks, 2012)

A Total Variation based approach for robust consensus in distributed networks. - Walid Ben-Ameur; Pascal Bianchi; Jérémie Jakubowicz (CDC, 2013)

The k-Separator Problem. - Walid Ben-Ameur; Mohamed-Ahmed Mohamed-Sidi; José Neto 001 (COCOON, 2013)

Byzantine resistant reputation-based trust management. - Amira Bradai; Walid Ben-Ameur; Hossam Afifi (CollaborateCom, 2013)

Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. - Ahmed Soua; Walid Ben-Ameur; Hossam Afifi (WONS, 2013)

An Interval Assignment Problem for Resource Optimization in LTE Networks. - Mohamad Assaad; Walid Ben-Ameur; Faiz Hamid (Electron. Notes Discret. Math., 2013)

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (Electron. Notes Discret. Math., 2013)

Multipolar routing: where dynamic and static routing meet. - Walid Ben-Ameur; Mateusz Zotkiewicz (Electron. Notes Discret. Math., 2013)

Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. - Walid Ben-Ameur; Makhlouf Hadji; Adam Ouorou (Networks, 2013)

Volume-oriented routing and its modifications. - Mateusz Zotkiewicz; Walid Ben-Ameur (Telecommun. Syst., 2013)

Fractional routing using pairs of failure-disjoint paths. - Walid Ben-Ameur; Michal Pióro; Mateusz Zotkiewicz (Discret. Appl. Math., 2014)

Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems. - Mohamad Assaad; Walid Ben-Ameur; Faiz Hamid (IEEE Trans. Signal Process., 2014)

Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G Systems. - Zeineb Hraiech; Fatma Abdelkefi; Mohamed Siala 001; Walid Ben-Ameur (VTC Spring, 2015)

A bottleneck-free tree-based name resolution system for Information-Centric Networking. - Wassef Louati; Walid Ben-Ameur; Djamal Zeghlache (Comput. Networks, 2015)

The $$k$$ k -separator problem: polyhedra, complexity and approximation results. - Walid Ben-Ameur; Mohamed-Ahmed Mohamed-Sidi; José Neto 001 (J. Comb. Optim., 2015)

Efficient algorithms for the maximum concurrent flow problem. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (Networks, 2015)

From Graph Orientation to the Unweighted Maximum Cut. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (COCOON, 2016)

How to Win Elections. - Abdallah Sobehy; Walid Ben-Ameur; Hossam Afifi; Amira Bradai (CollaborateCom, 2016)

Cables network design optimization for the Fiber To The Home. - Vincent Angilella; Matthieu Chardy; Walid Ben-Ameur (DRCN, 2016)

A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (ISCO, 2016)

Optimal Mapping of Cloud Virtual Machines. - Guanglei Wang; Walid Ben-Ameur; José Neto 001; Adam Ouorou (Electron. Notes Discret. Math., 2016)

Extended cuts. - Walid Ben-Ameur; Mohamed Didi Biha (J. Comb. Optim., 2016)

Robust Distributed Consensus Using Total Variation. - Walid Ben-Ameur; Pascal Bianchi; Jérémie Jakubowicz (IEEE Trans. Autom. Control., 2016)

Good versus Evil: A Framework for Optimal Investment Strategies for Competing Camps in a Social Network. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman (CoRR, 2017)

Convex and concave envelopes: Revisited and new perspectives. - Walid Ben-Ameur; Adam Ouorou; Guanglei Wang (Oper. Res. Lett., 2017)

Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman (AAAI, 2018)

Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman (AAMAS, 2018)

Fiber Cable Network Design with Operations Administration & Maintenance Constraints. - Vincent Angilella; Matthieu Chardy; Walid Ben-Ameur (ICORES, 2018)

Operations Administration and Maintenance Constraints in Fiber Cables Network Design. - Vincent Angilella; Matthieu Chardy; Walid Ben-Ameur (ICORES (Selected Papers), 2018)

A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing with Application to Blockchain Mining. - Swapnil Dhamal; Tijani Chahed; Walid Ben-Ameur; Eitan Altman; Albert Sunny; Sudheer Poojary (CoRR, 2018)

Complete formulations of polytopes related to extensions of assignment matrices. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (Discret. Optim., 2018)

Multipolar robust optimization. - Walid Ben-Ameur; Adam Ouorou; Guanglei Wang; Mateusz Zotkiewicz (EURO J. Comput. Optim., 2018)

Design of fiber cable tree FTTH networks. - Vincent Angilella; Walid Ben-Ameur; Matthieu Chardy (Electron. Notes Discret. Math., 2018)

Fiber cable network design in tree networks. - Vincent Angilella; Matthieu Chardy; Walid Ben-Ameur (Eur. J. Oper. Res., 2018)

On the most imbalanced orientation of a graph. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (J. Comb. Optim., 2018)

A note on the problem of r disjoint (s, t)-cuts and some related issues. - Walid Ben-Ameur; Mohamed Didi Biha (Oper. Res. Lett., 2018)

On fractional cut covers. - José Neto 001; Walid Ben-Ameur (Discret. Appl. Math., 2019)

A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. - Guanglei Wang; Walid Ben-Ameur; Adam Ouorou (Eur. J. Oper. Res., 2019)

Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman (IEEE Trans. Netw. Sci. Eng., 2019)

A two phase investment game for competitive opinion dynamics in social networks. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman (Inf. Process. Manag., 2020)

A framework for joint admission control, resource allocation and pricing for network slicing in 5G. - Walid Ben-Ameur; Lorela Cano; Tijani Chahed (GLOBECOM, 2021)

On the approximability of robust network design. - Yacine Al-Najjar; Walid Ben-Ameur; Jérémie Leguay (Theor. Comput. Sci., 2021)

Approximability of Robust Network Design: The Directed Case. - Yacine Al-Najjar; Walid Ben-Ameur; Jérémie Leguay (STACS, 2022)

New bounds for subset selection from conic relaxations. - Walid Ben-Ameur; José Neto 001 (Eur. J. Oper. Res., 2022)

Strategic investments in distributed computing: A stochastic game perspective. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman; Albert Sunny; Sudheer Poojary (J. Parallel Distributed Comput., 2022)

Affine routing for robust network design. - Yacine Al-Najjar; Walid Ben-Ameur; Jérémie Leguay; Jocelyne Elias (Networks, 2022)

Complexity results for a cops and robber game on directed graphs. - Walid Ben-Ameur; Alessandro Maddaloni (CoRR, 2024)

The no-meet matroid. - Walid Ben-Ameur; Natalia Kushik; Alessandro Maddaloni; José Neto 001; Dimitri Watel (Discret. Appl. Math., 2024)

A cops and robber game and the meeting time of synchronous directed walks. - Walid Ben-Ameur; Alessandro Maddaloni (Networks, 2024)

Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. - Walid Ben-Ameur (Oper. Res. Lett., 2024)

Subset Selection and the Cone of Factor-Width-k Matrices. - Walid Ben-Ameur (SIAM J. Optim., 2024)

A game theoretic framework for distributed computing with dynamic set of agents. - Swapnil Dhamal; Walid Ben-Ameur; Tijani Chahed; Eitan Altman; Albert Sunny; Sudheer Poojary (Ann. Oper. Res., 2024)

Hunting a Rabbit Is Hard. - Walid Ben-Ameur; Harmender Gahlawat; Alessandro Maddaloni (COCOON (1), 2025)