Countries citing papers authored by Patrick Prosser
Since
Specialization
Citations
This map shows the geographic impact of Patrick Prosser'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 Patrick Prosser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Patrick Prosser more than expected).
This network shows the impact of papers produced by Patrick Prosser. 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 Patrick Prosser. The network helps show where Patrick Prosser may publish in the future.
Co-authorship network of co-authors of Patrick Prosser
This figure shows the co-authorship network connecting the top 25 collaborators of Patrick Prosser.
A scholar is included among the top collaborators of Patrick Prosser 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 Patrick Prosser. Patrick Prosser is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
McCreesh, Ciaran, et al.. (2016). Heuristics and really hard instances for subgraph isomorphism problems. ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam). 631–638.6 indexed citations
3.
Codish, Michael, Alice Miller, Patrick Prosser, & Peter J. Stuckey. (2013). Breaking symmetries in graph representation. ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam). 510–516.7 indexed citations
4.
Prosser, Patrick, et al.. (2006). A Connectivity Constraint using Bridges. ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam).3 indexed citations
5.
Miller, Alice, et al.. (2005). A constraint model and a reduction operator for the minimising open stacks problem. ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam).1 indexed citations
6.
Beck, J. Christopher, et al.. (2003). Vehicle routing and job shop scheduling: what's the difference?. International Conference on Automated Planning and Scheduling. 267–276.33 indexed citations
7.
Gent, Ian P. & Patrick Prosser. (2002). An empirical study of the stable marriage problem with ties and incomplete lists. European Conference on Artificial Intelligence. 141–145.28 indexed citations
8.
McDonald, Kevin & Patrick Prosser. (2002). A student advisory system: a configuration problem for constraint programming.1 indexed citations
9.
Gent, Ian P., Holger H. Hoos, Patrick Prosser, & Toby Walsh. (1999). Morphing: combining structure and randomness. National Conference on Artificial Intelligence. 654–660.35 indexed citations
10.
Gent, Ian P., Ewan MacIntyre, Patrick Prosser, & Toby Walsh. (1997). The scaling of search cost. National Conference on Artificial Intelligence. 315–320.12 indexed citations
11.
Gent, Ian P., Ewan MacIntyre, Patrick Prosser, Peter Shaw, & Toby Walsh. (1997). The Constrainedness of Arc Consistency.8 indexed citations
12.
Gent, Ian P., Ewan MacIntyre, Patrick Prosser, & Toby Walsh. (1996). The constrainedness of search. National Conference on Artificial Intelligence. 246–252.102 indexed citations
Prosser, Patrick. (1994). Binary Constraint Satisfaction Problems: Some are Harder than Others.. European Conference on Artificial Intelligence. 95–99.45 indexed citations
15.
Prosser, Patrick. (1993). Scheduling as a constraint satisfaction problem: theory and practice. Ellis Horwood eBooks. 22–30.5 indexed citations
16.
Prosser, Patrick. (1993). Domain filtering can degrade intelligent backtracking search. International Joint Conference on Artificial Intelligence. 262–267.24 indexed citations
Prosser, Patrick. (1989). A reactive scheduling agent. International Joint Conference on Artificial Intelligence. 11(1). 1004–1009.24 indexed citations
20.
Prosser, Patrick. (1988). A Hybrid Genetic Algorithm for Pallet Loading.. European Conference on Artificial Intelligence. 159–164.20 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.