| APPROXIMATELY COUNTING AND SAMPLING SMALL WITNESSES USING A COLORFUL DECISION ORACLE | 0 | 0.34 | 2022 |
| Fine-Grained Reductions from Approximate Counting to Decision | 0 | 0.34 | 2021 |
| Modular Counting of Subgraphs - Matchings, Matching-Splittable Graphs, and Paths. | 0 | 0.34 | 2021 |
| Approximately counting and sampling small witnesses using a colourful decision oracle. | 0 | 0.34 | 2020 |
| Counting Answers to Existential Questions. | 0 | 0.34 | 2019 |
| The Exponential-Time Complexity Of Counting (Quantum) Graph Homomorphisms | 0 | 0.34 | 2019 |
| Finding Detours is Fixed-Parameter Tractable | 1 | 0.38 | 2019 |
| More consequences of falsifying SETH and the orthogonal vectors conjecture. | 3 | 0.38 | 2018 |
| Weisfeiler-Leman meets Homomorphisms. | 0 | 0.34 | 2018 |
| Fine-grained reductions from approximate counting to decision. | 2 | 0.41 | 2018 |
| Lovász Meets Weisfeiler and Leman. | 0 | 0.34 | 2018 |
| Extensor-Coding. | 1 | 0.36 | 2018 |
| Note on "The Complexity of Counting Surjective Homomorphisms and Compactions". | 0 | 0.34 | 2017 |
| A Fixed-Parameter Perspective on #BIS. | 2 | 0.41 | 2017 |
| Homomorphisms Are a Good Basis for Counting Small Subgraphs. | 8 | 0.54 | 2017 |
| The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. | 3 | 0.41 | 2017 |
| Counting edge-injective homomorphisms and matchings on restricted graph classes. | 0 | 0.34 | 2017 |
| Fine-grained dichotomies for the Tutte plane and Boolean #CSP. | 1 | 0.36 | 2016 |
| The First Parameterized Algorithms and Computational Experiments Challenge. | 0 | 0.34 | 2016 |
| Complexity and Approximability of Parameterized MAX-CSPs | 0 | 0.34 | 2015 |
| The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems | 3 | 0.41 | 2015 |
| AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations. | 0 | 0.34 | 2014 |
| A simple proof that AND-compression of NP-complete problems is hard. | 3 | 0.39 | 2014 |
| Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses | 74 | 1.97 | 2014 |
| Exponential Time Complexity of the Permanent and the Tutte Polynomial | 18 | 1.15 | 2012 |
| Complexity and Approximability of the Cover Polynomial | 3 | 0.39 | 2012 |
| Is Valiant–Vazirani’s isolation probability improvable? | 3 | 0.43 | 2012 |
| Kernelization of packing problems | 38 | 1.25 | 2012 |
| On Problems as Hard as CNF-SAT | 29 | 1.00 | 2012 |
| Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. | 0 | 0.34 | 2010 |
| Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions | 5 | 0.50 | 2010 |
| Complexity of the Bollobás-Riordan Polynomial | 5 | 0.47 | 2008 |
| Complexity of the cover polynomial | 18 | 0.82 | 2007 |
