Countries citing papers authored by Alan M. Frisch
Since
Specialization
Citations
This map shows the geographic impact of Alan M. Frisch'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 Alan M. Frisch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alan M. Frisch more than expected).
This network shows the impact of papers produced by Alan M. Frisch. 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 Alan M. Frisch. The network helps show where Alan M. Frisch may publish in the future.
Co-authorship network of co-authors of Alan M. Frisch
This figure shows the co-authorship network connecting the top 25 collaborators of Alan M. Frisch.
A scholar is included among the top collaborators of Alan M. Frisch 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 Alan M. Frisch. Alan M. Frisch is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Frisch, Alan M., et al.. (2007). The design of ESSENCE: a constraint language for specifying combinatorial problems. International Joint Conference on Artificial Intelligence. 80–87.26 indexed citations
3.
Frisch, Alan M., et al.. (2005). The rules of constraint modelling. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 109–116.25 indexed citations
4.
Frisch, Alan M., Christopher Jefferson, & Ian Miguel. (2004). Symmetry breaking as a prelude to implied constraints: a constraint modelling pattern. European Conference on Artificial Intelligence. 171–175.9 indexed citations
5.
Bartlett, Mark, et al.. (2004). Efficient Algorithms for Selecting Advanced Reservations. 12.2 indexed citations
6.
Flener, Pierre, Alan M. Frisch, Brahim Hnich, et al.. (2002). Breaking Row and Column Symmetries in Matrix Models. White Rose Research Online (University of Leeds, The University of Sheffield, University of York).1 indexed citations
7.
Frisch, Alan M., et al.. (2002). Automatically Reformulating Sat-Encoded CSPs.5 indexed citations
8.
Frisch, Alan M., Ian Miguel, & Toby Walsh. (2002). CGRASS: A System for Transforming Constraint Satisfaction Problems.1 indexed citations
Flener, Pierre, Alan M. Frisch, Brahim Hnich, et al.. (2002). Matrix modelling: Exploiting common patterns in constraint programming.12 indexed citations
11.
Frisch, Alan M., et al.. (2001). Solving non-Boolean satisfiability problems with stochastic local search. International Joint Conference on Artificial Intelligence. 282–288.36 indexed citations
12.
Frisch, Alan M. & C. David Page. (1995). Building theories into instantiation. International Joint Conference on Artificial Intelligence. 1210–1216.2 indexed citations
13.
Frisch, Alan M. & Richard B. Scherl. (1991). A general framework for modal deduction. Principles of Knowledge Representation and Reasoning. 196–207.14 indexed citations
Frisch, Alan M. & C. David Page. (1990). Generalization with taxonomic information. National Conference on Artificial Intelligence. 755–761.4 indexed citations
17.
Frisch, Alan M.. (1989). A general framework for sorted deduction: fundamental results on hybrid reasoning. Principles of Knowledge Representation and Reasoning. 126–136.25 indexed citations
18.
Frisch, Alan M.. (1987). Inference without chaining. International Joint Conference on Artificial Intelligence. 515–519.22 indexed citations
19.
Frisch, Alan M.. (1985). Using model theory to specify AI programs. International Joint Conference on Artificial Intelligence. 148–154.20 indexed citations
20.
Allen, James F., et al.. (1982). ARGOT: the rochester dialogue system. National Conference on Artificial Intelligence. 66–70.24 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.