default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalid Ben-Ameur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]Swapnil Dhamal
, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary:
A game theoretic framework for distributed computing with dynamic set of agents. Ann. Oper. Res. 336(3): 1871-1904 (2024)- [j61]Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel:
The no-meet matroid. Discret. Appl. Math. 354: 94-107 (2024) - [j60]Walid Ben-Ameur:
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. Oper. Res. Lett. 57: 107166 (2024) - [j59]Walid Ben-Ameur:
Subset Selection and the Cone of Factor-Width-k Matrices. SIAM J. Optim. 34(1): 817-843 (2024) - [i7]Walid Ben-Ameur, Alessandro Maddaloni:
Complexity results for a cops and robber game on directed graphs. CoRR abs/2410.04897 (2024) - 2022
- [j58]Walid Ben-Ameur, José Neto:
New bounds for subset selection from conic relaxations. Eur. J. Oper. Res. 298(2): 425-438 (2022) - [j57]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary:
Strategic investments in distributed computing: A stochastic game perspective. J. Parallel Distributed Comput. 169: 317-333 (2022) - [j56]Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias:
Affine routing for robust network design. Networks 79(4): 557-579 (2022) - [c29]Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay:
Approximability of Robust Network Design: The Directed Case. STACS 2022: 6:1-6:16 - 2021
- [j55]Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay:
On the approximability of robust network design. Theor. Comput. Sci. 860: 41-50 (2021) - [c28]Walid Ben-Ameur, Lorela Cano, Tijani Chahed:
A framework for joint admission control, resource allocation and pricing for network slicing in 5G. GLOBECOM 2021: 1-6 - 2020
- [j54]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
A two phase investment game for competitive opinion dynamics in social networks. Inf. Process. Manag. 57(2): 102064 (2020) - [i6]Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay:
On the Approximability of Robust Network Design. CoRR abs/2009.12291 (2020)
2010 – 2019
- 2019
- [j53]José Neto, Walid Ben-Ameur:
On fractional cut covers. Discret. Appl. Math. 265: 168-181 (2019) - [j52]Guanglei Wang, Walid Ben-Ameur, Adam Ouorou:
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. Eur. J. Oper. Res. 276(1): 28-39 (2019) - [j51]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework. IEEE Trans. Netw. Sci. Eng. 6(4): 628-645 (2019) - 2018
- [j50]Walid Ben-Ameur, Antoine Glorieux, José Neto:
Complete formulations of polytopes related to extensions of assignment matrices. Discret. Optim. 29: 133-147 (2018) - [j49]Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz:
Multipolar robust optimization. EURO J. Comput. Optim. 6(4): 395-434 (2018) - [j48]Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy:
Design of fiber cable tree FTTH networks. Electron. Notes Discret. Math. 64: 235-244 (2018) - [j47]Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur:
Fiber cable network design in tree networks. Eur. J. Oper. Res. 269(3): 1086-1106 (2018) - [j46]Walid Ben-Ameur, Antoine Glorieux, José Neto:
On the most imbalanced orientation of a graph. J. Comb. Optim. 36(2): 637-669 (2018) - [j45]Walid Ben-Ameur, Mohamed Didi Biha:
A note on the problem of r disjoint (s, t)-cuts and some related issues. Oper. Res. Lett. 46(3): 335-338 (2018) - [c27]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: 997-1006 - [c26]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. AAMAS 2018: 1927-1929 - [c25]Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur:
Operations Administration and Maintenance Constraints in Fiber Cables Network Design. ICORES (Selected Papers) 2018: 54-79 - [c24]Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur:
Fiber Cable Network Design with Operations Administration & Maintenance Constraints. ICORES 2018: 94-105 - [i5]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. CoRR abs/1804.06081 (2018) - [i4]Swapnil Dhamal, Tijani Chahed, Walid Ben-Ameur, Eitan Altman, Albert Sunny, Sudheer Poojary:
A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing with Application to Blockchain Mining. CoRR abs/1809.03143 (2018) - [i3]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks. CoRR abs/1811.08291 (2018) - 2017
- [j44]Walid Ben-Ameur, Adam Ouorou, Guanglei Wang:
Convex and concave envelopes: Revisited and new perspectives. Oper. Res. Lett. 45(5): 421-426 (2017) - [i2]Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman:
Good versus Evil: A Framework for Optimal Investment Strategies for Competing Camps in a Social Network. CoRR abs/1706.09297 (2017) - 2016
- [j43]Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou:
Optimal Mapping of Cloud Virtual Machines. Electron. Notes Discret. Math. 52: 93-100 (2016) - [j42]Walid Ben-Ameur, Mohamed Didi Biha:
Extended cuts. J. Comb. Optim. 31(3): 1034-1044 (2016) - [j41]Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz:
Robust Distributed Consensus Using Total Variation. IEEE Trans. Autom. Control. 61(6): 1550-1564 (2016) - [c23]Walid Ben-Ameur, Antoine Glorieux, José Neto:
From Graph Orientation to the Unweighted Maximum Cut. COCOON 2016: 370-384 - [c22]Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai:
How to Win Elections. CollaborateCom 2016: 221-230 - [c21]Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur:
Cables network design optimization for the Fiber To The Home. DRCN 2016: 87-94 - [c20]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: 13-25 - 2015
- [j40]Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache:
A bottleneck-free tree-based name resolution system for Information-Centric Networking. Comput. Networks 91: 341-355 (2015) - [j39]Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto:
The $$k$$ k -separator problem: polyhedra, complexity and approximation results. J. Comb. Optim. 29(1): 276-307 (2015) - [j38]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Efficient algorithms for the maximum concurrent flow problem. Networks 65(1): 56-67 (2015) - [c19]Walid Ben-Ameur, Antoine Glorieux, José Neto:
On the Most Imbalanced Orientation of a Graph. COCOON 2015: 16-29 - [c18]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: 1-6 - 2014
- [j37]Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz:
Fractional routing using pairs of failure-disjoint paths. Discret. Appl. Math. 164: 47-60 (2014) - [j36]Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid:
Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems. IEEE Trans. Signal Process. 62(18): 4896-4910 (2014) - 2013
- [j35]Walid Ben-Ameur, Mateusz Zotkiewicz:
Multipolar routing: where dynamic and static routing meet. Electron. Notes Discret. Math. 41: 61-68 (2013) - [j34]Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid:
An Interval Assignment Problem for Resource Optimization in LTE Networks. Electron. Notes Discret. Math. 41: 237-244 (2013) - [j33]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. Electron. Notes Discret. Math. 41: 311-318 (2013) - [j32]Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks 61(4): 335-355 (2013) - [j31]Mateusz Zotkiewicz, Walid Ben-Ameur:
Volume-oriented routing and its modifications. Telecommun. Syst. 52(2): 935-945 (2013) - [c17]Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz:
A Total Variation based approach for robust consensus in distributed networks. CDC 2013: 1690-1695 - [c16]Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto:
The k-Separator Problem. COCOON 2013: 337-348 - [c15]Amira Bradai, Walid Ben-Ameur, Hossam Afifi:
Byzantine resistant reputation-based trust management. CollaborateCom 2013: 269-278 - [c14]Ahmed Soua, Walid Ben-Ameur, Hossam Afifi:
Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. WONS 2013: 107-109 - 2012
- [j30]Walid Ben-Ameur, José Neto:
A gradient-based randomised heuristic for the maximum cut problem. Int. J. Math. Oper. Res. 4(3): 276-293 (2012) - [j29]Walid Ben-Ameur, Mohamed Didi Biha:
On the minimum cut separator problem. Networks 59(1): 30-36 (2012) - [c13]Ahmed Soua, Walid Ben-Ameur, Hossam Afifi:
Broadcast-based directional routing in vehicular ad-hoc networks. WMNC 2012: 48-53 - [c12]Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz:
Robust average consensus using Total Variation Gossip Algorithm. VALUETOOLS 2012: 99-106 - [c11]Ahmed Soua, Walid Ben-Ameur, Hossam Afifi:
Analysis of information relay processing in inter-vehicle communication: A novel visit. WiMob 2012: 157-164 - [c10]Ahmed Soua, Walid Ben-Ameur, Hossam Afifi:
Enhancing broadcast vehicular communications using beamforming technique. WiMob 2012: 557-562 - [i1]Ahmed Soua, Walid Ben-Ameur, Hossam Afifi:
Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks. CoRR abs/1206.1358 (2012) - 2011
- [j28]Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache:
Virtual network provisioning across multiple substrate networks. Comput. Networks 55(4): 1011-1023 (2011) - [j27]Walid Ben-Ameur, José Neto:
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discret. Appl. Math. 159(16): 1689-1698 (2011) - [j26]Walid Ben-Ameur, Mateusz Zotkiewicz:
Robust routing and optimal partitioning of a traffic demand polytope. Int. Trans. Oper. Res. 18(3): 307-333 (2011) - [c9]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Cache Location in Tree Networks: Preliminary Results. INOC 2011: 517-522 - 2010
- [j25]Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Networks with unicyclic connected components and without short cycles. Electron. Notes Discret. Math. 36: 961-968 (2010) - [j24]Walid Ben-Ameur, Makhlouf Hadji:
Steiner Networks with unicyclic connected components. Electron. Notes Discret. Math. 36: 969-976 (2010) - [j23]Walid Ben-Ameur, Mohamed Didi Biha:
Algorithms and formulations for the minimum cut separator problem. Electron. Notes Discret. Math. 36: 977-983 (2010) - [j22]Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro:
Failure disjoint paths. Electron. Notes Discret. Math. 36: 1105-1112 (2010) - [j21]Walid Ben-Ameur, Mateusz Zotkiewicz:
Polynomial traffic demand polytope partitioning. Electron. Notes Discret. Math. 36: 1113-1120 (2010) - [j20]Walid Ben-Ameur, José Neto:
Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. Eur. J. Oper. Res. 207(1): 15-24 (2010) - [j19]Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro:
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. IEEE Commun. Lett. 14(8): 776-778 (2010) - [j18]Walid Ben-Ameur, Makhlouf Hadji:
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. SIAM J. Discret. Math. 24(4): 1541-1557 (2010) - [c8]Walid Ben-Ameur, Pablo Pavón-Mariño, Michal Pióro:
On Traffic Domination in Communication Networks. PERFORM 2010: 191-202
2000 – 2009
- 2009
- [c7]Walid Ben-Ameur, José Neto:
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. CTW 2009: 105-108 - [c6]Mateusz Zotkiewicz, Walid Ben-Ameur:
More Adaptive Robust Stable Routing. GLOBECOM 2009: 1-6 - 2008
- [j17]Walid Ben-Ameur, José Neto:
A geometric characterization of "optimality-equivalent" relaxations. J. Glob. Optim. 42(4): 533-547 (2008) - [j16]Walid Ben-Ameur, José Neto:
Spectral bounds for the maximum cut problem. Networks 52(1): 8-13 (2008) - [c5]Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi:
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. ICN 2008: 692-697 - 2007
- [j15]Walid Ben-Ameur, José Neto:
Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1): 3-17 (2007) - [j14]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Preface. Networks 50(1): 1-2 (2007) - [j13]Meriema Belaidouni, Walid Ben-Ameur:
On the minimum cost multiple-source unsplittable flow problem. RAIRO Oper. Res. 41(3): 253-273 (2007) - [c4]Walid Ben-Ameur:
Between fully dynamic routing and robust stable routing. DRCN 2007: 1-6 - 2006
- [j12]Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee:
Foreword. Ann. Oper. Res. 146(1): 1-2 (2006) - [j11]Walid Ben-Ameur, Adam Ouorou:
Mathematical Models of the Delay Constrained Routing Problem. Algorithmic Oper. Res. 1(2) (2006) - [j10]Walid Ben-Ameur:
New bounds for the maximum cut problem. Electron. Notes Discret. Math. 27: 5 (2006) - [j9]Walid Ben-Ameur, José Neto:
A constraint generation algorithm for large scale linear programs using multiple-points separation. Math. Program. 107(3): 517-537 (2006) - [j8]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Further contributions to network optimization. Networks 48(1): 1-6 (2006) - [c3]Walid Ben-Ameur:
On the Maximum Cut Problem. ACiD 2006: 154 - 2004
- [j7]Walid Ben-Ameur:
Computing the Initial Temperature of Simulated Annealing. Comput. Optim. Appl. 29(3): 369-385 (2004) - [j6]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Some recent contributions to network optimization. Networks 44(1): 27-30 (2004) - [c2]Kaouthar Sethom, Hossam Afifi, Walid Ben-Ameur:
M&M's: an MPLS micro-mobility solution. ISWCS 2004: 334-337 - 2003
- [j5]Walid Ben-Ameur, Hervé Kerivin:
Networks new economical virtual private. Commun. ACM 46(6): 69-73 (2003) - [j4]Walid Ben-Ameur, Éric Gourdin:
Internet Routing and Related Topology Issues. SIAM J. Discret. Math. 17(1): 18-49 (2003) - 2002
- [j3]Walid Ben-Ameur:
Multi-hour design of survivable classical IP networks. Int. J. Commun. Syst. 15(6): 553-572 (2002) - 2001
- [j2]Walid Ben-Ameur, Bernard Liau:
Calcul des métriques de routage pour Internet. Ann. des Télécommunications 56(3-4): 150-168 (2001) - [c1]Thi Tuyet Loan Pham, Walid Ben-Ameur:
Design of Survivible Networks Based on End-to-End Rerouting. DRCN 2001: 258-265 - 2000
- [j1]Walid Ben-Ameur:
Constrained length connectivity and survivable networks. Networks 36(1): 17-33 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
