Belaïd Benhamou

600 total citations
45 papers, 249 citations indexed

About

Belaïd Benhamou is a scholar working on Artificial Intelligence, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Belaïd Benhamou has authored 45 papers receiving a total of 249 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 16 papers in Computer Networks and Communications and 11 papers in Industrial and Manufacturing Engineering. Recurrent topics in Belaïd Benhamou's work include Logic, Reasoning, and Knowledge (12 papers), Constraint Satisfaction and Optimization (9 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Belaïd Benhamou is often cited by papers focused on Logic, Reasoning, and Knowledge (12 papers), Constraint Satisfaction and Optimization (9 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Belaïd Benhamou collaborates with scholars based in France, Algeria and Austria. Belaïd Benhamou's co-authors include Dalila Boughaci, Habiba Drias, Lakhdar Saïs, Djamal Habet, Fatima Benbouzid-Si Tayeb, Volker Sorge, Jacques Calmet, Pierre Siegel, Gilles Audemard and Sylvain Soliman and has published in prestigious journals such as Bioinformatics, Applied Soft Computing and Theoretical Computer Science.

In The Last Decade

Belaïd Benhamou

41 papers receiving 238 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Belaïd Benhamou France 9 100 99 51 50 50 45 249
Stylianos Basagiannis Greece 10 88 0.9× 122 1.2× 20 0.4× 38 0.8× 37 0.7× 29 271
Zoya Svitkina United States 9 56 0.6× 103 1.0× 41 0.8× 57 1.1× 59 1.2× 17 218
Emmanuel Hébrard France 10 98 1.0× 179 1.8× 110 2.2× 57 1.1× 92 1.8× 29 296
Dnyanesh Rajpathak United States 10 147 1.5× 24 0.2× 50 1.0× 14 0.3× 42 0.8× 16 293
Matthias Englert United Kingdom 10 57 0.6× 195 2.0× 89 1.7× 70 1.4× 38 0.8× 30 283
Nelson Rangel-Valdez Mexico 10 111 1.1× 21 0.2× 72 1.4× 111 2.2× 96 1.9× 54 314
Yi-Chin Wu United States 8 211 2.1× 208 2.1× 24 0.5× 326 6.5× 13 0.3× 11 452
Hossein Esfandiari United States 10 85 0.8× 121 1.2× 10 0.2× 97 1.9× 67 1.3× 42 261
Zeynep Kiziltan Italy 10 120 1.2× 175 1.8× 40 0.8× 46 0.9× 41 0.8× 37 272
Alessandra Bagnato Spain 8 53 0.5× 91 0.9× 22 0.4× 20 0.4× 24 0.5× 42 261

Countries citing papers authored by Belaïd Benhamou

Since Specialization
Citations

This map shows the geographic impact of Belaïd Benhamou'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 Belaïd Benhamou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Belaïd Benhamou more than expected).

Fields of papers citing papers by Belaïd Benhamou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Belaïd Benhamou. 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 Belaïd Benhamou. The network helps show where Belaïd Benhamou may publish in the future.

Co-authorship network of co-authors of Belaïd Benhamou

This figure shows the co-authorship network connecting the top 25 collaborators of Belaïd Benhamou. A scholar is included among the top collaborators of Belaïd Benhamou 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 Belaïd Benhamou. Belaïd Benhamou 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.
Benhamou, Belaïd, et al.. (2024). Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. Proceedings of the AAAI Conference on Artificial Intelligence. 38(9). 10714–10722.
2.
Benhamou, Belaïd, et al.. (2023). Trap spaces of multi-valued networks: definition, computation, and applications. Bioinformatics. 39(Supplement_1). i513–i522. 1 indexed citations
3.
Benhamou, Belaïd, et al.. (2023). Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. Theoretical Computer Science. 971. 114073–114073. 4 indexed citations
4.
Benhamou, Belaïd, et al.. (2021). Evolutionary Iterated Local Search meta‐heuristic for the antenna positioning problem in cellular networks. Computational Intelligence. 38(3). 1183–1214. 1 indexed citations
5.
Benhamou, Belaïd, et al.. (2020). An ASP-based Approach for Boolean Networks Representation and Attractor Detection. EPiC series in computing. 73. 317–299. 1 indexed citations
6.
Boughaci, Dalila, et al.. (2020). A synergy Thompson sampling hyper‐heuristic for the feature selection problem. Computational Intelligence. 38(3). 1083–1105. 5 indexed citations
7.
Boughaci, Dalila, et al.. (2019). A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. Intelligent Decision Technologies. 13(2). 193–210. 2 indexed citations
8.
Boughaci, Dalila, et al.. (2017). A multilevel hyper-heuristic for solving Max-SAT. 6(3). 133–133. 2 indexed citations
9.
Benhamou, Belaïd, et al.. (2012). Simultaneous Heat and Mass Transfer in Inclined Channel with Asymmetrical Conditions. Journal of Applied Fluid Mechanics. 12(3). 1 indexed citations
10.
Benhamou, Belaïd, et al.. (2012). Dealing with Satisfiability and n-ary CSPs in a logical framework. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
11.
Benhamou, Belaïd, et al.. (2010). Dealing with Satisfiability and n-ary CSPs in a Logical Framework. Journal of Automated Reasoning. 48(3). 391–417. 2 indexed citations
12.
Benhamou, Belaïd, et al.. (2008). A new incomplete method for CSP inconsistency checking. National Conference on Artificial Intelligence. 229–234. 1 indexed citations
13.
Boughaci, Dalila, Belaïd Benhamou, & Habiba Drias. (2008). A memetic algorithm for the optimal winner determination problem. Soft Computing. 13(8-9). 905–917. 28 indexed citations
14.
Boughaci, Dalila, Belaïd Benhamou, & Habiba Drias. (2007). IGA: an Improved Genetic Algorithm for MAX-SAT Problems.. Indian International Conference on Artificial Intelligence. 132–150. 3 indexed citations
15.
Habet, Djamal, et al.. (2007). Consistent Neighborhood for the Satisfiability Problem. 57. 497–501. 11 indexed citations
16.
Boughaci, Dalila, Habiba Drias, & Belaïd Benhamou. (2005). Solving MAX-SAT problems using a memetic evolutionary meta-heuristic. 1. 480–484. 7 indexed citations
17.
Audemard, Gilles & Belaïd Benhamou. (2002). Reasoning by symmetry and function ordering in finite model generation. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
18.
Benhamou, Belaïd. (1995). Theoretical study of dominance in constraint satisfaction problems. 91–97.
19.
Benhamou, Belaïd & Lakhdar Saïs. (1994). Tractability through symmetries in propositional calculus. Journal of Automated Reasoning. 12(1). 89–102. 22 indexed citations
20.
Benhamou, Belaïd, et al.. (1991). [Infantile visceral leishmaniasis in Morocco. A review of 67 cases managed at the Rabat Hospital for children (1979-1988)].. PubMed. 38(7). 497–502. 3 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

Rankless by CCL
2026