David Richerby

540 total citations
28 papers, 206 citations indexed

About

David Richerby is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, David Richerby has authored 28 papers receiving a total of 206 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in David Richerby's work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (10 papers) and Bayesian Modeling and Causal Inference (4 papers). David Richerby is often cited by papers focused on Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (10 papers) and Bayesian Modeling and Causal Inference (4 papers). David Richerby collaborates with scholars based in United Kingdom, Spain and United States. David Richerby's co-authors include Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, Dimitrios M. Thilikos, Mark Jerrum, Anuj Dawar, Benjamin Rossman, George B. Mertzios, Paul G. Spirakis and Andreǐ A. Bulatov and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

David Richerby

25 papers receiving 188 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
David Richerby United Kingdom 9 137 75 41 34 31 28 206
Antar Bandyopadhyay India 5 28 0.2× 82 1.1× 40 1.0× 4 0.1× 6 0.2× 18 209
Christina Goldschmidt United Kingdom 9 26 0.2× 102 1.4× 50 1.2× 3 0.1× 19 0.6× 20 277
Christopher Hoffman United States 12 81 0.6× 154 2.1× 47 1.1× 4 0.1× 5 0.2× 46 382
Jonathan Jordan United Kingdom 9 34 0.2× 12 0.2× 19 0.5× 12 0.4× 4 0.1× 40 227
Martin Raußen Denmark 11 165 1.2× 14 0.2× 59 1.4× 5 0.1× 2 0.1× 39 337
Christian Elsholtz Austria 9 34 0.2× 6 0.1× 60 1.5× 31 0.9× 33 1.1× 43 321
Andrew R. Wade United Kingdom 8 13 0.1× 73 1.0× 25 0.6× 11 0.3× 2 0.1× 36 207
Svante Linusson Sweden 10 137 1.0× 47 0.6× 42 1.0× 1 0.0× 7 0.2× 40 334
Alexandre Stauffer United Kingdom 9 22 0.2× 46 0.6× 13 0.3× 9 0.3× 2 0.1× 33 182
Milton Rosenberg United States 10 89 0.6× 16 0.2× 30 0.7× 12 0.4× 2 0.1× 18 253

Countries citing papers authored by David Richerby

Since Specialization
Citations

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

Fields of papers citing papers by David Richerby

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of David Richerby

This figure shows the co-authorship network connecting the top 25 collaborators of David Richerby. A scholar is included among the top collaborators of David Richerby 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 David Richerby. David Richerby 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.
Richerby, David, et al.. (2020). Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs. 75–84. 4 indexed citations
2.
Richerby, David, et al.. (2020). FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theoretical Computer Science. 854. 136–158. 5 indexed citations
3.
Bulatov, Andreĭ A., Leslie Ann Goldberg, Mark Jerrum, David Richerby, & Stanislav Živný. (2017). Functional clones and expressibility of partition functions. Theoretical Computer Science. 687. 11–39. 2 indexed citations
4.
Goldberg, Leslie Ann, et al.. (2015). Counting List Matrix Partitions of Graphs. SIAM Journal on Computing. 44(4). 1089–1118.
5.
Goldberg, Leslie Ann, et al.. (2014). 4 Absorption Time of the Moran Process∗. QRU Quaderns de Recerca en Urbanisme. 12 indexed citations
6.
Dı́az, Josep, Leslie Ann Goldberg, David Richerby, & Marı́a Serna. (2014). Absorption Time of the Moran Process. 28. 642. 1 indexed citations
7.
Chen, Xi, Martin Dyer, Leslie Ann Goldberg, et al.. (2014). The complexity of approximating conservative counting CSPs. Journal of Computer and System Sciences. 81(1). 311–329. 5 indexed citations
8.
Goldberg, Leslie Ann, et al.. (2014). The complexity of counting homomorphisms to cactus graphs modulo 2. arXiv (Cornell University). 6(4). 1–29. 2 indexed citations
9.
Chen, Xi, Martin Dyer, Leslie Ann Goldberg, et al.. (2013). The complexity of approximating conservative counting CSPs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
10.
Dyer, Martin & David Richerby. (2013). An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM Journal on Computing. 42(3). 1245–1274. 33 indexed citations
11.
Dyer, Martin, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2012). The complexity of approximating bounded-degree Boolean #CSP. Information and Computation. 220-221. 1–14. 5 indexed citations
12.
Dı́az, Josep, Leslie Ann Goldberg, George B. Mertzios, et al.. (2012). Approximating Fixation Probabilities in the Generalized Moran Process. Durham Research Online (Durham University). 954–960. 3 indexed citations
13.
Bulatov, Andreĭ A., Martin Dyer, Leslie Ann Goldberg, et al.. (2011). The complexity of weighted and unweighted #CSP. Journal of Computer and System Sciences. 78(2). 681–688. 22 indexed citations
14.
Dyer, Martin & David Richerby. (2011). The #CSP Dichotomy is Decidable. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 10 indexed citations
15.
Richerby, David & Dimitrios M. Thilikos. (2011). Searching for a Visible, Lazy Fugitive. SIAM Journal on Discrete Mathematics. 25(2). 497–513. 3 indexed citations
16.
Dyer, Martin, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2010). The Complexity of Approximating Bounded-Degree Boolean #CSP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5. 334. 6 indexed citations
17.
Bulatov, Andreǐ A., Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2009). The complexity of weighted Boolean #CSP with mixed signs. Theoretical Computer Science. 410(38-40). 3949–3961. 20 indexed citations
18.
Richerby, David. (2008). Interval bigraphs are unit grid intersection graphs. Discrete Mathematics. 309(6). 1718–1719.
19.
Dawar, Anuj, David Richerby, & Benjamin Rossman. (2008). Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs. Annals of Pure and Applied Logic. 152(1-3). 31–50. 11 indexed citations
20.
Dawar, Anuj, David Richerby, & Benjamin Rossman. (2005). Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs. Electronic Notes in Theoretical Computer Science. 143. 13–26. 3 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

Breakdown of academic impact, for papers by Antar Bandyopadhyay Breakdown of academic impact, for papers by Christina Goldschmidt Breakdown of academic impact, for papers by Christopher Hoffman Breakdown of academic impact, for papers by Jonathan Jordan Breakdown of academic impact, for papers by Martin Raußen Breakdown of academic impact, for papers by Christian Elsholtz Breakdown of academic impact, for papers by Andrew R. Wade Breakdown of academic impact, for papers by Svante Linusson Breakdown of academic impact, for papers by Alexandre Stauffer Breakdown of academic impact, for papers by Milton Rosenberg
Rankless by CCL
2026