Countries citing papers authored by Djamila Sam-Haroud
Since
Specialization
Citations
This map shows the geographic impact of Djamila Sam-Haroud'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 Djamila Sam-Haroud with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Djamila Sam-Haroud more than expected).
Fields of papers citing papers by Djamila Sam-Haroud
This network shows the impact of papers produced by Djamila Sam-Haroud. 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 Djamila Sam-Haroud. The network helps show where Djamila Sam-Haroud may publish in the future.
Co-authorship network of co-authors of Djamila Sam-Haroud
This figure shows the co-authorship network connecting the top 25 collaborators of Djamila Sam-Haroud.
A scholar is included among the top collaborators of Djamila Sam-Haroud 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 Djamila Sam-Haroud. Djamila Sam-Haroud 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.
Schichl, Hermann, et al.. (2009). Interval propagation and search on directed acyclic graphs for numerical constraint solving. Computational Optimization and Applications. 45(4). 499–531.1 indexed citations
Sam-Haroud, Djamila, et al.. (2004). A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation. Infoscience (Ecole Polytechnique Fédérale de Lausanne).4 indexed citations
6.
Sam-Haroud, Djamila, et al.. (2002). Résolution de problèmes non-linéaires avec continuum de solutions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 27–41.1 indexed citations
7.
Silaghi, Marius, Djamila Sam-Haroud, Monique Calisti, & Boi Faltings. (2001). Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 45–54.4 indexed citations
8.
Silaghi, Marius, Djamila Sam-Haroud, & Boi Faltings. (2001). Polynomial Space and Complete Multiply Asynchronous Search with Abstractions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 17–32.3 indexed citations
9.
Silaghi, Marius, Djamila Sam-Haroud, & Boi Faltings. (2001). Maintaining Consistency for ABT. Infoscience (Ecole Polytechnique Fédérale de Lausanne).2 indexed citations
10.
Spellucci, Peter, Arnold Neumaier, Laurent Granvilliers, et al.. (2001). Algorithms for Solving Non-Linear Constrained and Optimization Problems: The State of The Art. Infoscience (Ecole Polytechnique Fédérale de Lausanne).17 indexed citations
Sam-Haroud, Djamila, et al.. (1999). Path consistency on triangulated constraint graphs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 456–461.27 indexed citations
18.
Sam-Haroud, Djamila, et al.. (1999). Search Techniques for CSPs with Ordered Domains. Infoscience (Ecole Polytechnique Fédérale de Lausanne).1 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.