An Effective Dichotomy for the Counting Constraint Satisfaction Problem von Dyer, Martin, Richerby, David

Volltext

FLUID: A common model for semantic structural graph summaries based on equivalence relations von Blume, Till, Richerby, David, Scherp, Ansgar

Volltext

Faster exponential-time algorithms for approximately counting independent sets von Goldberg, Leslie Ann, Lapinskas, John, Richerby, David

Volltext

Amplifiers for the Moran Process von Galanis, Andreas, Göbel, Andreas, Goldberg, Leslie Ann, Lapinskas, John, Richerby, David

Volltext

Phase transitions of the Moran process and algorithmic consequences von Goldberg, Leslie, Lapinskas, John, Richerby, David

Volltext

Counting 4×4 matrix partitions of graphs von Dyer, Martin, Goldberg, Leslie Ann, Richerby, David

Volltext

Functional clones and expressibility of partition functions von Bulatov, Andrei, Goldberg, Leslie Ann, Jerrum, Mark, Richerby, David, Živný, Stanislav

Volltext

Interval bigraphs are unit grid intersection graphs von Richerby, David

Volltext

Absorption time of the Moran process von Díaz, Josep, Goldberg, Leslie Ann, Richerby, David, Serna, Maria

Volltext

Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis von Rau, Jannik, Richerby, David, Scherp, Ansgar

Volltext

The complexity of approximating conservative counting CSPs von Chen, Xi, Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark, Lu, Pinyan, McQuillan, Colin, Richerby, David

Volltext

The complexity of weighted and unweighted # CSP von Bulatov, Andrei, Dyer, Martin, Goldberg, Leslie Ann, Jalsenius, Markus, Jerrum, Mark, Richerby, David

Volltext

Counting Homomorphisms to Square-Free Graphs, Modulo 2 von Göbel, Andreas, Goldberg, Leslie Ann, Richerby, David

Volltext

Approximating Fixation Probabilities in the Generalized Moran Process von Díaz, Josep, Goldberg, Leslie Ann, Mertzios, George B., Richerby, David, Serna, Maria, Spirakis, Paul G.

Volltext

The complexity of counting homomorphisms to cactus graphs modulo 2 von Göbel, Andreas, Goldberg, Leslie Ann, Richerby, David

Volltext

The complexity of approximating bounded-degree Boolean #CSP von Dyer, Martin, Goldberg, Leslie Ann, Jalsenius, Markus, Richerby, David

Volltext

On the fixation probability of superstars von Díaz, Josep, Goldberg, Leslie Ann, Mertzios, George B., Richerby, David, Serna, Maria, Spirakis, Paul G.

Volltext

Counting List Matrix Partitions of Graphs von Göbel, Andreas, Goldberg, Leslie Ann, McQuillan, Colin, Richerby, David, Yamakami, Tomoyuki

Volltext

Logical Characterizations of PSPACE von Richerby, David

Volltext

Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs von Dawar, Anuj, Richerby, David, Rossman, Benjamin

Volltext