| Publication | Date of Publication | Type |
|---|
Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
| 2024-01-12 | Paper |
Faster exponential-time algorithms for approximately counting independent sets
Theoretical Computer Science | 2021-10-21 | Paper |
FLUID: a common model for semantic structural graph summaries based on equivalence relations
Theoretical Computer Science | 2021-01-25 | Paper |
Phase transitions of the Moran process and algorithmic consequences
Random Structures & Algorithms | 2020-06-19 | Paper |
Counting homomorphisms to square-free graphs, modulo 2
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Approximating fixation probabilities in the generalized Moran process
| 2019-05-10 | Paper |
Amplifiers for the Moran process
Journal of the ACM | 2018-08-02 | Paper |
Amplifiers for the Moran process
| 2017-12-19 | Paper |
On the fixation probability of superstars
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
Functional clones and expressibility of partition functions
Theoretical Computer Science | 2017-06-13 | Paper |
Absorption time of the Moran process
| 2017-03-22 | Paper |
scientific article; zbMATH DE number 6691415 (Why is no real title available?)
| 2017-03-03 | Paper |
The complexity of approximating conservative counting CSPs
| 2017-01-30 | Paper |
The complexity of counting homomorphisms to cactus graphs modulo 2
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Counting \(4 \times 4\) matrix partitions of graphs
Discrete Applied Mathematics | 2016-09-12 | Paper |
Absorption time of the Moran process
Random Structures & Algorithms | 2016-09-07 | Paper |
Counting homomorphisms to square-free graphs, modulo 2
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Counting List Matrix Partitions of Graphs
SIAM Journal on Computing | 2015-09-02 | Paper |
Approximating fixation probabilities in the generalized Moran process
Algorithmica | 2014-11-19 | Paper |
The complexity of approximating conservative counting CSPs
Journal of Computer and System Sciences | 2014-09-22 | Paper |
On the complexity of \#CSP
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An effective dichotomy for the counting constraint satisfaction problem
SIAM Journal on Computing | 2013-09-25 | Paper |
The complexity of approximating bounded-degree Boolean \(\#\)CSP
Information and Computation | 2013-01-17 | Paper |
The complexity of weighted and unweighted \(\#\)CSP
Journal of Computer and System Sciences | 2012-05-11 | Paper |
scientific article; zbMATH DE number 5999552 (Why is no real title available?)
| 2012-01-23 | Paper |
The complexity of approximating bounded-degree Boolean \#CSP
| 2012-01-23 | Paper |
Searching for a Visible, Lazy Fugitive
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Graph searching in a crime wave
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The complexity of weighted Boolean \#CSP with mixed signs
Theoretical Computer Science | 2009-09-10 | Paper |
Interval bigraphs are unit grid intersection graphs
Discrete Mathematics | 2009-06-17 | Paper |
The Power of Counting Logics on Restricted Classes of Finite Structures
Computer Science Logic | 2009-03-05 | Paper |
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Graph Searching in a Crime Wave
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Fixed-point Logics with Nondeterministic Choice
Journal Of Logic And Computation | 2003-11-10 | Paper |
