Countries citing papers authored by Frédéric Benhamou
Since
Specialization
Citations
This map shows the geographic impact of Frédéric 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 Frédéric Benhamou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frédéric Benhamou more than expected).
Fields of papers citing papers by Frédéric Benhamou
This network shows the impact of papers produced by Frédéric 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 Frédéric Benhamou. The network helps show where Frédéric Benhamou may publish in the future.
Co-authorship network of co-authors of Frédéric Benhamou
This figure shows the co-authorship network connecting the top 25 collaborators of Frédéric Benhamou.
A scholar is included among the top collaborators of Frédéric 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 Frédéric Benhamou. Frédéric Benhamou is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Benhamou, Frédéric, Narendra Jussien, & Barry O’Sullivan. (2006). Future and trends of Constraint Programming.1 indexed citations
3.
Benhamou, Frédéric. (2006). Principle and Practice of Constraint Programming - CP 2006: 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings (Lecture Notes in Computer Science). Springer eBooks.1 indexed citations
4.
Benhamou, Frédéric. (2006). Proceedings of the 12th international conference on Principles and Practice of Constraint Programming.5 indexed citations
Bordeaux, Lucas, Éric Monfroy, & Frédéric Benhamou. (2001). Improved bounds on the complexity of kB-consistency. International Joint Conference on Artificial Intelligence. 303–308.5 indexed citations
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
10.
Benhamou, Frédéric, et al.. (2000). Universally Quantified Interval Constraint Solving: an application to camera control. arXiv (Cornell University).1 indexed citations
11.
Benhamou, Frédéric, et al.. (1999). An Extension of the WAM for Hybrid Interval Solvers.. 1999.7 indexed citations
Benhamou, Frédéric, David McAllester, & Pascal Van Hentenryck. (1994). CLP(intervals) revisited. International Conference on Logic Programming. 124–138.111 indexed citations
Benhamou, Frédéric, et al.. (1993). Boolean pseudo-equations in constraint logic programming. International Conference on Logic Programming. 517–531.4 indexed citations
19.
Older, William J. & Frédéric Benhamou. (1993). Programming in CLP(BNR).. 228–238.20 indexed citations
20.
Benhamou, Frédéric. (1991). The Prolog III CLP language. Artificial Intelligence Review. 4. 37.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.