David Richerby

From MaRDI portal
Person:313798

Available identifiers

zbMath Open richerby.david-mDBLPr/DavidRicherbyWikidataQ102279003 ScholiaQ102279003MaRDI QIDQ313798

List of research outcomes





PublicationDate of PublicationType
Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis2024-01-12Paper
Faster exponential-time algorithms for approximately counting independent sets2021-10-21Paper
FLUID: a common model for semantic structural graph summaries based on equivalence relations2021-01-25Paper
Phase transitions of the Moran process and algorithmic consequences2020-06-19Paper
Counting Homomorphisms to Square-Free Graphs, Modulo 22019-12-06Paper
https://portal.mardi4nfdi.de/entity/Q57434502019-05-10Paper
Amplifiers for the Moran Process2018-08-02Paper
Amplifiers for the Moran Process2017-12-19Paper
On the fixation probability of superstars2017-09-29Paper
Functional clones and expressibility of partition functions2017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q29696512017-03-22Paper
https://portal.mardi4nfdi.de/entity/Q29654972017-03-03Paper
The complexity of approximating conservative counting CSPs.2017-01-30Paper
The complexity of counting homomorphisms to cactus graphs modulo 22016-10-24Paper
Counting \(4 \times 4\) matrix partitions of graphs2016-09-12Paper
Absorption time of the Moran process2016-09-07Paper
Counting Homomorphisms to Square-Free Graphs, Modulo 22015-10-27Paper
Counting List Matrix Partitions of Graphs2015-09-02Paper
Approximating fixation probabilities in the generalized Moran process2014-11-19Paper
The complexity of approximating conservative counting CSPs2014-09-22Paper
On the complexity of \#CSP2014-08-13Paper
An effective dichotomy for the counting constraint satisfaction problem2013-09-25Paper
The complexity of approximating bounded-degree Boolean \(\#\)CSP2013-01-17Paper
The complexity of weighted and unweighted \(\#\)CSP2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q31136902012-01-23Paper
The Complexity of Approximating Bounded-Degree Boolean #CSP2012-01-23Paper
Searching for a Visible, Lazy Fugitive2011-10-27Paper
Graph Searching in a Crime Wave2010-03-17Paper
The complexity of weighted Boolean \#CSP with mixed signs2009-09-10Paper
Interval bigraphs are unit grid intersection graphs2009-06-17Paper
The Power of Counting Logics on Restricted Classes of Finite Structures2009-03-05Paper
Searching for a Visible, Lazy Fugitive2009-01-20Paper
Graph Searching in a Crime Wave2008-07-01Paper
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs2008-03-28Paper
Computer Science Logic2007-06-21Paper
Computer Science Logic2005-08-22Paper
Fixed-point Logics with Nondeterministic Choice2003-11-10Paper

Research outcomes over time

This page was built for person: David Richerby