| Publication | Date of Publication | Type |
|---|
| Nearly optimal independence oracle algorithms for edge estimation in hypergraphs | 2026-01-14 | Paper |
| PACE solver description: exact (GUTHMI) and heuristic (GUTHM) | 2025-09-24 | Paper |
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
(available as arXiv preprint) | 2023-09-20 | Paper |
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
SIAM Journal on Computing | 2022-07-22 | Paper |
Counting Answers to Existential Questions
(available as arXiv preprint) | 2022-07-21 | Paper |
Fine-Grained Reductions from Approximate Counting to Decision
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Lov\'asz Meets Weisfeiler and Leman
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximately counting and sampling small witnesses using a colourful decision oracle
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Finding detours is fixed-parameter tractable | 2020-05-27 | Paper |
| A fixed-parameter perspective on \#BIS | 2020-05-27 | Paper |
| The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration | 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 |
Extensor-coding
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
More consequences of falsifying SETH and the orthogonal vectors conjecture
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fine-grained reductions from approximate counting to decision
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fine-grained reductions from approximate counting to decision
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Kernelization of packing problems
(available as arXiv preprint) | 2019-05-10 | Paper |
| Kernelization of packing problems | 2019-05-10 | Paper |
Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
Algorithmica | 2019-02-14 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Exponential Time Complexity of the Permanent and the Tutte Polynomial
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Exponential Time Complexity of the Permanent and the Tutte Polynomial
ACM Transactions on Algorithms | 2018-10-30 | 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 |
Complexity and approximability of parameterized MAX-CSPs
Algorithmica | 2017-10-10 | Paper |
Complexity and Approximability of Parameterized MAX-CSPs
(available as arXiv preprint) | 2017-09-29 | 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 |
AND-compression of NP-complete problems: streamlined proof and minor observations
Algorithmica | 2016-09-07 | Paper |
The parity of set systems under random restrictions with applications to exponential time problems
Automata, Languages, and Programming | 2015-10-27 | Paper |
AND-compression of NP-complete problems: streamlined proof and minor observations
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Journal of the ACM | 2015-08-14 | Paper |
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Is Valiant-Vazirani's isolation probability improvable?
Computational Complexity | 2013-07-19 | Paper |
Complexity and approximability of the cover polynomial
Computational Complexity | 2012-08-24 | Paper |
Exponential time complexity of the permanent and the Tutte polynomial (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
Theory of Computing Systems | 2010-08-13 | Paper |
Complexity of the Bollobás-Riordan Polynomial
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Complexity of the Cover Polynomial
Automata, Languages and Programming | 2007-11-28 | Paper |
