| Publication | Date of Publication | Type |
|---|
| Count on CFI graphs for \#P-hardness | 2024-11-28 | Paper |
| On the VNP-hardness of some monomial symmetric polynomials | 2024-09-12 | Paper |
| Parameterizing the permanent: hardness for fixed excluded minors | 2024-05-14 | Paper |
A full complexity dichotomy for immanant families
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
(available as arXiv preprint) | 2023-09-20 | Paper |
| Count on CFI graphs for #P-hardness | 2023-05-08 | Paper |
| scientific article; zbMATH DE number 7650305 (Why is no real title available?) | 2023-02-03 | Paper |
| Determinants from homomorphisms | 2022-04-22 | Paper |
| Counting problems in parameterized complexity | 2021-08-04 | Paper |
| A fixed-parameter perspective on \#BIS | 2020-05-27 | Paper |
| Finding detours is fixed-parameter tractable | 2020-05-27 | Paper |
| The Exponential Time complexity of counting (quantum) graph homomorphisms | 2020-02-24 | Paper |
Finding detours is fixed-parameter tractable
SIAM Journal on Discrete Mathematics | 2019-11-27 | Paper |
A fixed-parameter perspective on \#BIS
Algorithmica | 2019-09-10 | Paper |
Counting edge-injective homomorphisms and matchings on restricted graph classes
Theory of Computing Systems | 2019-08-27 | Paper |
| scientific article; zbMATH DE number 7075922 (Why is no real title available?) | 2019-07-03 | Paper |
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Block interpolation: a framework for tight exponential-time counting complexity
Information and Computation | 2018-06-14 | Paper |
Counting edge-injective homomorphisms and matchings on restricted graph classes
(available as arXiv preprint) | 2018-04-19 | Paper |
| A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | 2018-03-15 | Paper |
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
(available as arXiv preprint) | 2018-03-15 | Paper |
Counting matchings with \(k\) unmatched vertices in planar graphs
(available as arXiv preprint) | 2018-03-02 | Paper |
Parity separation: a scientifically proven method for permanent weight loss
(available as arXiv preprint) | 2017-12-19 | Paper |
Homomorphisms are a good basis for counting small subgraphs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Homomorphisms are a good basis for counting small subgraphs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
A quantization framework for smoothed analysis of Euclidean optimization problems
Algorithmica | 2015-11-19 | Paper |
Block interpolation: a framework for tight exponential-time counting complexity
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Counting triangulations and other crossing-free structures via onion layers
Discrete & Computational Geometry | 2015-06-26 | Paper |
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
A quantization framework for smoothed analysis of Euclidean optimization problems
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Counting matchings of size \(k\) is \#W[1-hard]
Automata, Languages, and Programming | 2013-08-06 | Paper |
Weighted counting of \(k\)-matchings is \#W[1-hard]
Parameterized and Exact Computation | 2013-01-07 | Paper |
The complexity of the cover polynomials for planar graphs of bounded degree
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
