| Publication | Date of Publication | Type |
|---|
Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
ACM Transactions on Computational Logic | 2026-03-26 | Paper |
| Parameterised and fine-grained subgraph counting, Modulo 2 | 2024-11-14 | Paper |
Counting subgraphs in somewhere dense graphs
SIAM Journal on Computing | 2024-10-21 | Paper |
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process
Theoretical Computer Science | 2024-10-07 | Paper |
| Counting subgraphs in somewhere dense graphs | 2024-09-25 | Paper |
| The complexity of pattern counting in directed graphs, parameterised by the outdegree | 2024-05-08 | Paper |
Parameterised and fine-grained subgraph counting, modulo 2
Algorithmica | 2024-04-02 | Paper |
Counting Small Induced Subgraphs with Hereditary Properties
SIAM Journal on Computing | 2024-03-19 | Paper |
| scientific article; zbMATH DE number 7788475 (Why is no real title available?) | 2024-01-15 | Paper |
Counting small induced subgraphs with hereditary properties
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Counting small induced subgraphs with hereditary properties
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Parameterized (Modular) Counting and Cayley Graph Expanders
(available as arXiv preprint) | 2023-08-08 | Paper |
Parameterized Counting and Cayley Graph Expanders
SIAM Journal on Discrete Mathematics | 2023-05-31 | Paper |
Counting Answers to Existential Questions
(available as arXiv preprint) | 2022-07-21 | Paper |
Counting induced subgraphs: an algebraic approach to \#W[1-hardness]
(available as arXiv preprint) | 2022-07-21 | Paper |
Counting Small Induced Subgraphs Satisfying Monotone Properties
SIAM Journal on Computing | 2022-04-20 | Paper |
Counting induced subgraphs: an algebraic approach to \#W[1-hardness]
Algorithmica | 2022-03-25 | Paper |
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Counting induced subgraphs: a topological approach to \#W[1-hardness]
(available as arXiv preprint) | 2021-08-04 | Paper |
Parameterized counting of partially injective homomorphisms
Algorithmica | 2021-06-11 | Paper |
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Counting induced subgraphs: a topological approach to \#W[1-hardness]
Algorithmica | 2020-08-12 | Paper |
Counting restricted homomorphisms via Möbius inversion over matroid lattices
(available as arXiv preprint) | 2020-05-27 | Paper |
Counting edge-injective homomorphisms and matchings on restricted graph classes
Theory of Computing Systems | 2019-08-27 | Paper |
Counting Induced Subgraphs: An Algebraic Approach to #W[1-hardness]
(available as arXiv preprint) | 2019-04-23 | Paper |
Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
Algorithmica | 2019-02-14 | Paper |
Counting edge-injective homomorphisms and matchings on restricted graph classes
(available as arXiv preprint) | 2018-04-19 | Paper |
Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
(available as arXiv preprint) | 2018-04-10 | Paper |
Parameterized counting of trees, forests and matroid bases
(available as arXiv preprint) | 2017-08-22 | Paper |
