This map shows the geographic impact of Lakhdar Saïs'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 Lakhdar Saïs with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lakhdar Saïs more than expected).
This network shows the impact of papers produced by Lakhdar Saïs. 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 Lakhdar Saïs. The network helps show where Lakhdar Saïs may publish in the future.
Co-authorship network of co-authors of Lakhdar Saïs
This figure shows the co-authorship network connecting the top 25 collaborators of Lakhdar Saïs.
A scholar is included among the top collaborators of Lakhdar Saïs 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 Lakhdar Saïs. Lakhdar Saïs 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.
Saïs, Lakhdar, et al.. (2019). Solving a Potential Clustering Game. International Journal of Artificial Intelligence Tools. 28(2). 1950006–1950006.1 indexed citations
2.
Jabbour, Saïd, et al.. (2018). SAT-Based Data Mining. International Journal of Artificial Intelligence Tools. 27(1). 1840002–1840002.3 indexed citations
Saïs, Lakhdar, et al.. (2016). Z-Equilibrium For a CSP Game..1 indexed citations
7.
Jabbour, Saïd, et al.. (2016). A SAT-based approach for mining association rules. International Joint Conference on Artificial Intelligence. 2472–2478.7 indexed citations
Jabbour, Saïd, Lakhdar Saïs, & Yakoub Salhi. (2013). A Pigeon-Hole Based Encoding of Cardinality Constraints.. Theory and Practice of Logic Programming. 13.3 indexed citations
Saïs, Lakhdar, et al.. (2008). Redundancy in {CSPs}. HAL (Le Centre pour la Communication Scientifique Directe).5 indexed citations
14.
Piette, Cédric, Youssef Hamadi, & Lakhdar Saïs. (2008). Vivification de formules propositionnelles clausales. HAL (Le Centre pour la Communication Scientifique Directe). 277–285.
15.
Grégoire, Éric, Bertrand Mazure, & Lakhdar Saïs. (2007). Logically-Complete Local Search for Propositional Nonmonotonic Knowledge Bases. HAL (Le Centre pour la Communication Scientifique Directe).
Boussemart, Frédéric, Fred Hémery, Christophe Lecoutre, & Lakhdar Saïs. (2004). Boosting systematic search by weighting constraints. European Conference on Artificial Intelligence. 146–150.156 indexed citations
18.
Grégoire, Éric, et al.. (2002). Recovering and exploiting structural knowledge from cnf formulas. HAL (Le Centre pour la Communication Scientifique Directe).12 indexed citations
19.
Mazure, Bertrand, Lakhdar Saïs, & Éric Grégoire. (1997). Tabu search for SAT. HAL (Le Centre pour la Communication Scientifique Directe). 281–285.53 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.