A Fixed-Point Logic with Symmetric Choice. - Anuj Dawar; David Richerby (CSL, 2003)

Fixed-point Logics with Nondeterministic Choice. - Anuj Dawar; David Richerby (J. Log. Comput., 2003)

Logical Characterizations of PSPACE. - David Richerby (CSL, 2004)

Fixed-point logics with choice. - David Richerby (2004)

Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). - Anuj Dawar; David Richerby; Benjamin Rossman (WoLLIC, 2005)

The Power of Counting Logics on Restricted Classes of Finite Structures. - Anuj Dawar; David Richerby (CSL, 2007)

Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. - Anuj Dawar; David Richerby; Benjamin Rossman (Ann. Pure Appl. Log., 2008)

Interval bigraphs are unit grid intersection graphs. - David Richerby (Discret. Math., 2009)

Graph Searching in a Crime Wave. - David Richerby; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2009)

The complexity of weighted Boolean #CSP with mixed signs. - Andrei A. Bulatov; Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (Theor. Comput. Sci., 2009)

On the complexity of #CSP. - Martin E. Dyer; David Richerby (STOC, 2010)

The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) - Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (CoRR, 2010)

The #CSP Dichotomy is Decidable. - Martin E. Dyer; David Richerby (STACS, 2011)

Searching for a Visible, Lazy Fugitive. - David Richerby; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2011)

Can Fixation be Guaranteed in the Generalized Moran Process? - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (CoRR, 2012)

The complexity of approximating bounded-degree Boolean #CSP. - Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (Inf. Comput., 2012)

The complexity of weighted and unweighted #CSP. - Andrei A. Bulatov; Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; Mark Jerrum; David Richerby (J. Comput. Syst. Sci., 2012)

An Effective Dichotomy for the Counting Constraint Satisfaction Problem. - Martin E. Dyer; David Richerby (SIAM J. Comput., 2013)

Counting Homomorphisms to Cactus Graphs Modulo 2. - Andreas Göbel 001; Leslie Ann Goldberg; David Richerby (STACS, 2014)

Approximating Fixation Probabilities in the Generalized Moran Process. - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (Algorithmica, 2014)

The complexity of counting homomorphisms to cactus graphs modulo 2. - Andreas Göbel 001; Leslie Ann Goldberg; David Richerby (ACM Trans. Comput. Theory, 2014)

The complexity of approximating conservative counting CSPs. - Xi Chen 001; Martin E. Dyer; Leslie Ann Goldberg; Mark Jerrum; Pinyan Lu; Colin McQuillan; David Richerby (J. Comput. Syst. Sci., 2015)

Counting List Matrix Partitions of Graphs. - Andreas Göbel 001; Leslie Ann Goldberg; Colin McQuillan; David Richerby; Tomoyuki Yamakami (SIAM J. Comput., 2015)

Counting 4×4 matrix partitions of graphs. - Martin E. Dyer; Leslie Ann Goldberg; David Richerby (Discret. Appl. Math., 2016)

Absorption time of the Moran process. - Josep Díaz; Leslie Ann Goldberg; David Richerby; Maria J. Serna (Random Struct. Algorithms, 2016)

Counting Homomorphisms to Square-Free Graphs, Modulo 2. - Andreas Göbel 001; Leslie Ann Goldberg; David Richerby (ACM Trans. Comput. Theory, 2016)

Amplifiers for the Moran Process. - Andreas Galanis; Andreas Göbel 001; Leslie Ann Goldberg; John Lapinskas; David Richerby (J. ACM, 2017)

Functional clones and expressibility of partition functions. - Andrei Bulatov 001; Leslie Ann Goldberg; Mark Jerrum; David Richerby; Stanislav Zivný (Theor. Comput. Sci., 2017)

Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs. - Till Blume; David Richerby; Ansgar Scherp (CIKM, 2020)

Phase transitions of the Moran process and algorithmic consequences. - Leslie Ann Goldberg; John Lapinskas; David Richerby (Random Struct. Algorithms, 2020)

Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs. - Till Blume; David Richerby; Ansgar Scherp (CoRR, 2021)

FLUID: A common model for semantic structural graph summaries based on equivalence relations. - Till Blume; David Richerby; Ansgar Scherp (Theor. Comput. Sci., 2021)

Faster exponential-time algorithms for approximately counting independent sets. - Leslie Ann Goldberg; John Lapinskas; David Richerby (Theor. Comput. Sci., 2021)

Graph Summarization as Vertex Classification Task using Graph Neural Networks vs. Bloom Filter. - Maximilian Blasi; Manuel Freudenreich; Johannes Horvath; David Richerby; Ansgar Scherp (DSAA, 2022)

Graph Summarization with Graph Neural Networks. - Maximilian Blasi; Manuel Freudenreich; Johannes Horvath; David Richerby; Ansgar Scherp (CoRR, 2022)

Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs. - Jannik Rau; David Richerby; Ansgar Scherp (CoRR, 2022)

Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis. - Jannik Rau; David Richerby; Ansgar Scherp (ICGT, 2023)

Structural Summarization of Semantic Graphs Using Quotients. - Ansgar Scherp; David Richerby; Till Blume; Michael Cochez; Jannik Rau (TGDK, 2023)

Lifelong Graph Learning for Graph Summarization. - Jonatan Frank; Marcel Hoffmann 002; Nicolas Lell; David Richerby; Ansgar Scherp (WI/IAT, 2024)

Multi-View Structural Graph Summaries. - Jonatan Frank; Andor Diera; David Richerby; Ansgar Scherp (WI/IAT, 2024)

Lifelong Graph Summarization with Neural Networks: 2012, 2022, and a Time Warp. - Jonatan Frank; Marcel Hoffmann 002; Nicolas Lell; David Richerby; Ansgar Scherp (CoRR, 2024)