Countries citing papers authored by Justin Pearson
Since
Specialization
Citations
This map shows the geographic impact of Justin Pearson'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 Justin Pearson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Justin Pearson more than expected).
This network shows the impact of papers produced by Justin Pearson. 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 Justin Pearson. The network helps show where Justin Pearson may publish in the future.
Co-authorship network of co-authors of Justin Pearson
This figure shows the co-authorship network connecting the top 25 collaborators of Justin Pearson.
A scholar is included among the top collaborators of Justin Pearson 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 Justin Pearson. Justin Pearson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Carlsson, Mats, et al.. (2014). Protocol log analysis with constraint programming : Work in progress. KTH Publication Database DiVA (KTH Royal Institute of Technology). 17–26.
Ågren, Magnus S., Pierre Flener, & Justin Pearson. (2008). Revisiting constraint-directed search. Information and Computation. 207(3). 438–457.3 indexed citations
Flener, Pierre, et al.. (2006). Static and Dynamic Structural Symmetry Breaking. Sabanci University.1 indexed citations
16.
Pearson, Justin. (2004). Symmetry breaking in constraint satisfaction with graph-isomorphism: Comma-free codes. Annals of Mathematics and Artificial Intelligence.1 indexed citations
17.
Hentenryck, Pascal Van, Pierre Flener, Justin Pearson, & Magnus S. Ågren. (2003). Tractable symmetry breaking for CSPs with interchangeable values. International Joint Conference on Artificial Intelligence. 277–282.19 indexed citations
18.
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
19.
Larsen, Kim G., Justin Pearson, Carsten Weise, & Wang Yi. (1999). Clock difference diagrams. Nordic journal of computing. 6(3). 271–298.27 indexed citations
20.
Jeavons, Peter, David A. Cohen, & Justin Pearson. (1998). Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence. 24(1-4). 51–67.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.