Walid Ben‐Ameur

1.1k total citations
49 papers, 654 citations indexed

About

Walid Ben‐Ameur is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Walid Ben‐Ameur has authored 49 papers receiving a total of 654 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computer Networks and Communications, 22 papers in Electrical and Electronic Engineering and 20 papers in Computational Theory and Mathematics. Recurrent topics in Walid Ben‐Ameur's work include Advanced Optical Network Technologies (15 papers), Complexity and Algorithms in Graphs (14 papers) and Advanced Graph Theory Research (13 papers). Walid Ben‐Ameur is often cited by papers focused on Advanced Optical Network Technologies (15 papers), Complexity and Algorithms in Graphs (14 papers) and Advanced Graph Theory Research (13 papers). Walid Ben‐Ameur collaborates with scholars based in France, Poland and Sweden. Walid Ben‐Ameur's co-authors include Hervé Kerivin, Éric Gourdin, Mateusz Żotkiewicz, Adam Ouorou, Jérémie Jakubowicz, Pascal Bianchi, Michał Pióro, Tijani Chahed, Guanglei Wang and Eitan Altman and has published in prestigious journals such as IEEE Transactions on Automatic Control, Communications of the ACM and European Journal of Operational Research.

In The Last Decade

Walid Ben‐Ameur

45 papers receiving 615 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Walid Ben‐Ameur 275 220 132 127 83 49 654
Roland Wessäly 630 2.3× 692 3.1× 113 0.9× 85 0.7× 50 0.6× 33 1.0k
Artur Tomaszewski 672 2.4× 582 2.6× 83 0.6× 60 0.5× 56 0.7× 51 987
Viswanath Nagarajan 396 1.4× 82 0.4× 220 1.7× 331 2.6× 161 1.9× 76 862
Anna Moss 320 1.2× 106 0.5× 61 0.5× 192 1.5× 85 1.0× 7 738
Stefano Coniglio 199 0.7× 147 0.7× 85 0.6× 44 0.3× 64 0.8× 48 450
Rico Zenklusen 308 1.1× 70 0.3× 144 1.1× 398 3.1× 153 1.8× 53 779
Jochen Könemann 715 2.6× 285 1.3× 169 1.3× 497 3.9× 121 1.5× 50 1.2k
Deepak Rajan 280 1.0× 222 1.0× 76 0.6× 50 0.4× 48 0.6× 31 612
Una Benlic 161 0.6× 86 0.4× 407 3.1× 133 1.0× 95 1.1× 32 772
Abdel Lisser 107 0.4× 100 0.5× 148 1.1× 138 1.1× 321 3.9× 85 742

Countries citing papers authored by Walid Ben‐Ameur

Since Specialization
Citations

This map shows the geographic impact of Walid Ben‐Ameur's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Walid Ben‐Ameur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Walid Ben‐Ameur more than expected).

Fields of papers citing papers by Walid Ben‐Ameur

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Walid Ben‐Ameur. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Walid Ben‐Ameur. The network helps show where Walid Ben‐Ameur may publish in the future.

Co-authorship network of co-authors of Walid Ben‐Ameur

This figure shows the co-authorship network connecting the top 25 collaborators of Walid Ben‐Ameur. A scholar is included among the top collaborators of Walid Ben‐Ameur based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Walid Ben‐Ameur. Walid Ben‐Ameur is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ben‐Ameur, Walid, et al.. (2024). A cops and robber game and the meeting time of synchronous directed walks. Networks. 84(2). 238–251.
2.
Ben‐Ameur, Walid. (2024). Subset Selection and the Cone of Factor-Width-kMatrices. SIAM Journal on Optimization. 34(1). 817–843.
3.
Ben‐Ameur, Walid, et al.. (2022). The no-meet matroid. Discrete Applied Mathematics. 354. 94–107. 1 indexed citations
4.
Ben‐Ameur, Walid, et al.. (2022). Strategic investments in distributed computing: A stochastic game perspective. Journal of Parallel and Distributed Computing. 169. 317–333. 1 indexed citations
5.
Ben‐Ameur, Walid, et al.. (2021). New bounds for subset selection from conic relaxations. European Journal of Operational Research. 298(2). 425–438. 1 indexed citations
6.
Ben‐Ameur, Walid, et al.. (2019). On fractional cut covers. Discrete Applied Mathematics. 265. 168–181.
7.
Ben‐Ameur, Walid, et al.. (2018). Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework. HAL (Le Centre pour la Communication Scientifique Directe). 17 indexed citations
8.
Wang, Guanglei, Walid Ben‐Ameur, & Adam Ouorou. (2018). A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. European Journal of Operational Research. 276(1). 28–39. 7 indexed citations
9.
Ben‐Ameur, Walid, Adam Ouorou, & Guanglei Wang. (2017). Convex and concave envelopes: Revisited and new perspectives. Operations Research Letters. 45(5). 421–426. 5 indexed citations
10.
Ben‐Ameur, Walid, et al.. (2014). The $$k$$ k -separator problem: polyhedra, complexity and approximation results. Journal of Combinatorial Optimization. 29(1). 276–307. 14 indexed citations
11.
Ben‐Ameur, Walid, Michał Pióro, & Mateusz Żotkiewicz. (2012). Fractional routing using pairs of failure-disjoint paths. Discrete Applied Mathematics. 164. 47–60. 1 indexed citations
12.
Żotkiewicz, Mateusz & Walid Ben‐Ameur. (2011). Volume-oriented routing and its modifications. Telecommunication Systems. 3 indexed citations
13.
Ben‐Ameur, Walid, et al.. (2010). A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discrete Applied Mathematics. 159(16). 1689–1698. 6 indexed citations
14.
Żotkiewicz, Mateusz, Walid Ben‐Ameur, & Michał Pióro. (2010). Failure disjoint paths. Electronic Notes in Discrete Mathematics. 36. 1105–1112. 1 indexed citations
15.
Ben‐Ameur, Walid, et al.. (2007). Spectral bounds for the maximum cut problem. Networks. 52(1). 8–13. 4 indexed citations
16.
Ben‐Ameur, Walid, et al.. (2007). On the minimum cost multiple-source unsplittable flow problem. RAIRO - Operations Research. 41(3). 253–273. 10 indexed citations
17.
Ben‐Ameur, Walid & Hervé Kerivin. (2005). Routing of Uncertain Traffic Demands. Optimization and Engineering. 6(3). 283–313. 98 indexed citations
18.
Ben‐Ameur, Walid & Luı́s Gouveia. (2004). Some recent contributions to network optimization. Networks. 44(1). 27–30. 3 indexed citations
19.
Kerivin, Hervé & Walid Ben‐Ameur. (2003). NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS. Communications of the ACM. 46(6). 69–73. 31 indexed citations
20.
Ben‐Ameur, Walid. (2002). Multi‐hour design of survivable classical IP networks. International Journal of Communication Systems. 15(6). 553–572. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Roland Wessäly Breakdown of academic impact, for papers by Artur Tomaszewski Breakdown of academic impact, for papers by Viswanath Nagarajan Breakdown of academic impact, for papers by Anna Moss Breakdown of academic impact, for papers by Stefano Coniglio Breakdown of academic impact, for papers by Rico Zenklusen Breakdown of academic impact, for papers by Jochen Könemann Breakdown of academic impact, for papers by Deepak Rajan Breakdown of academic impact, for papers by Una Benlic Breakdown of academic impact, for papers by Abdel Lisser
Rankless by CCL
2026