Peter Jeavons

5.5k total citations
78 papers, 2.3k citations indexed

About

Peter Jeavons is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Peter Jeavons has authored 78 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computer Networks and Communications, 40 papers in Computational Theory and Mathematics and 20 papers in Artificial Intelligence. Recurrent topics in Peter Jeavons's work include Constraint Satisfaction and Optimization (39 papers), Advanced Graph Theory Research (24 papers) and Data Management and Algorithms (16 papers). Peter Jeavons is often cited by papers focused on Constraint Satisfaction and Optimization (39 papers), Advanced Graph Theory Research (24 papers) and Data Management and Algorithms (16 papers). Peter Jeavons collaborates with scholars based in United Kingdom, France and United States. Peter Jeavons's co-authors include David A. Cohen, Andrei Krokhin, Martin Cooper, Marc Gyssens, Andreĭ A. Bulatov, Peter Jönsson, Alexander R.A. Anderson, Daniel Nichol, John Shawe‐Taylor and Jacob G. Scott and has published in prestigious journals such as Nature Communications, Bioinformatics and Genetics.

In The Last Decade

Peter Jeavons

76 papers receiving 2.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Peter Jeavons United Kingdom 25 1.3k 1.3k 540 410 176 78 2.3k
Bart Jacobs Netherlands 27 375 0.3× 1.1k 0.8× 1.7k 3.2× 198 0.5× 59 0.3× 165 2.7k
Danny Kriz̧anc United States 23 1.2k 0.9× 448 0.3× 264 0.5× 76 0.2× 102 0.6× 145 2.1k
Devdatt Dubhashi Sweden 16 360 0.3× 294 0.2× 594 1.1× 56 0.1× 43 0.2× 71 1.5k
Chuan Yi Tang Taiwan 23 270 0.2× 384 0.3× 249 0.5× 70 0.2× 146 0.8× 145 1.7k
Martin Tompa United States 27 238 0.2× 672 0.5× 1.1k 2.0× 146 0.4× 437 2.5× 81 3.6k
George S. Lueker United States 18 863 0.6× 1.4k 1.1× 526 1.0× 303 0.7× 76 0.4× 41 2.6k
Marek Chrobák United States 26 1.1k 0.9× 669 0.5× 363 0.7× 71 0.2× 31 0.2× 120 2.0k
Dániel Marx Hungary 26 1.1k 0.8× 2.2k 1.7× 503 0.9× 280 0.7× 35 0.2× 147 2.9k
Marek Karpiński Germany 26 917 0.7× 1.6k 1.2× 1.2k 2.2× 167 0.4× 41 0.2× 190 2.8k
Daniel Lokshtanov Norway 22 772 0.6× 2.0k 1.6× 284 0.5× 56 0.1× 30 0.2× 159 2.4k

Countries citing papers authored by Peter Jeavons

Since Specialization
Citations

This map shows the geographic impact of Peter Jeavons'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 Peter Jeavons with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Jeavons more than expected).

Fields of papers citing papers by Peter Jeavons

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Jeavons. 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 Peter Jeavons. The network helps show where Peter Jeavons may publish in the future.

Co-authorship network of co-authors of Peter Jeavons

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Jeavons. A scholar is included among the top collaborators of Peter Jeavons 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 Peter Jeavons. Peter Jeavons 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.
Nichol, Daniel, Joseph Rutter, Chris Bryant, et al.. (2019). Antibiotic collateral sensitivity is contingent on the repeatability of evolution. Nature Communications. 10(1). 334–334. 116 indexed citations
2.
Nichol, Daniel, Mark Robertson‐Tessi, Peter Jeavons, & Alexander R.A. Anderson. (2016). Stochasticity in the Genotype-Phenotype Map: Implications for the Robustness and Persistence of Bet-Hedging. Genetics. 204(4). 1523–1539. 32 indexed citations
3.
Nichol, Daniel, Peter Jeavons, Alexander G. Fletcher, et al.. (2015). Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance. PLoS Computational Biology. 11(9). e1004493–e1004493. 102 indexed citations
4.
Jeavons, Peter, Andrei Krokhin, & Stanislav Živný. (2014). The Complexity of Valued Constraint Satisfaction. Durham Research Online (Durham University). 2(113). 9 indexed citations
5.
Cooper, Martin, et al.. (2010). Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artificial Intelligence. 174(9-10). 570–584. 26 indexed citations
6.
Živný, Stanislav, David A. Cohen, & Peter Jeavons. (2009). The expressive power of binary submodular functions. Discrete Applied Mathematics. 157(15). 3347–3358. 28 indexed citations
7.
Jeavons, Peter, et al.. (2009). The complexity of constraint satisfaction games and QCSP. Information and Computation. 207(9). 923–944. 22 indexed citations
8.
Cohen, David A., Martin Cooper, & Peter Jeavons. (2008). Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science. 401(1-3). 36–51. 14 indexed citations
9.
Cohen, David A., Peter Jeavons, & Marc Gyssens. (2007). A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences. 74(5). 721–743. 33 indexed citations
10.
Cohen, David A., Peter Jeavons, Christopher Jefferson, Karen E. Petrie, & Barbara M. Smith. (2006). Constraint symmetry and solution symmetry. Oxford University Research Archive (ORA) (University of Oxford). 1589–1592. 1 indexed citations
11.
Cohen, David A., Martin Cooper, & Peter Jeavons. (2006). An algebraic characterisation of complexity for valued constraints. Oxford University Research Archive (ORA) (University of Oxford). 3 indexed citations
12.
Cohen, David A., Martin Cooper, Peter Jeavons, & Andrei Krokhin. (2006). The complexity of soft constraint satisfaction. Artificial Intelligence. 170(11). 983–1016. 48 indexed citations
13.
Cohen, David A., Martin Cooper, Peter Jeavons, & Andrei Krokhin. (2005). Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics. 149(1-3). 53–72. 22 indexed citations
14.
Cohen, David A., Peter Jeavons, & Marc Gyssens. (2005). A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. Document Server@UHasselt (UHasselt). 72–77. 14 indexed citations
15.
Cohen, David A., et al.. (2003). New tractable constraint classes from old. Morgan Kaufmann Publishers Inc. eBooks. 331–354. 3 indexed citations
16.
Krokhin, Andrei, Peter Jeavons, & Peter Jönsson. (2001). A complete classification of complexity in Allen's algebra in the presence of a non-trivial basic relation. Oxford University Research Archive (ORA) (University of Oxford). 83–88. 5 indexed citations
17.
Jeavons, Peter, David A. Cohen, & Martin Cooper. (1998). Constraints, consistency and closure. Artificial Intelligence. 101(1-2). 251–265. 117 indexed citations
18.
Jeavons, Peter & Martin Cooper. (1995). Tractable constraints on ordered domains. Artificial Intelligence. 79(2). 327–339. 82 indexed citations
19.
Jeavons, Peter, et al.. (1994). A structural decomposition for hypergraphs. Contemporary mathematics - American Mathematical Society. 161–177. 2 indexed citations
20.
Jeavons, Peter. (1993). Counting representable sets on simple graphs. Discrete Applied Mathematics. 47(1). 33–46. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026