Holger Dell

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths	2023-09-20	Paper
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle	2022-07-22	Paper
Counting Answers to Existential Questions	2022-07-21	Paper
Fine-Grained Reductions from Approximate Counting to Decision	2022-03-22	Paper
Lov\'asz Meets Weisfeiler and Leman	2021-07-28	Paper
Approximately counting and sampling small witnesses using a colourful decision oracle	2021-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q5111872	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111890	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111385	2020-05-27	Paper
The Exponential Time complexity of counting (quantum) graph homomorphisms	2020-02-24	Paper
Finding Detours is Fixed-Parameter Tractable	2019-11-27	Paper
A fixed-parameter perspective on \#BIS	2019-09-10	Paper
Counting edge-injective homomorphisms and matchings on restricted graph classes	2019-08-27	Paper
Extensor-coding	2019-08-22	Paper
Fine-grained reductions from approximate counting to decision	2019-08-22	Paper
More consequences of falsifying SETH and the orthogonal vectors conjecture	2019-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q5743378	2019-05-10	Paper
Fine-grained dichotomies for the Tutte plane and Boolean \#CSP	2019-02-14	Paper
On Problems as Hard as CNF-SAT	2018-11-05	Paper
Exponential Time Complexity of the Permanent and the Tutte Polynomial	2018-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4636623	2018-04-19	Paper
Fine-grained dichotomies for the Tutte plane and Boolean #CSP	2018-04-10	Paper
Complexity and approximability of parameterized MAX-CSPs	2017-10-10	Paper
Complexity and Approximability of Parameterized MAX-CSPs	2017-09-29	Paper
Homomorphisms are a good basis for counting small subgraphs	2017-08-17	Paper
AND-compression of NP-complete problems: streamlined proof and minor observations	2016-09-07	Paper
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems	2015-10-27	Paper
AND-compression of NP-complete problems: streamlined proof and minor observations	2015-09-15	Paper
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses	2015-08-14	Paper
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses	2014-08-13	Paper
Is Valiant-Vazirani's isolation probability improvable?	2013-07-19	Paper
Complexity and approximability of the cover polynomial	2012-08-24	Paper
Exponential Time Complexity of the Permanent and the Tutte Polynomial	2010-09-07	Paper
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions	2010-08-13	Paper
Complexity of the Bollobás-Riordan Polynomial	2008-06-05	Paper
Complexity of the Cover Polynomial	2007-11-28	Paper

Research outcomes over time

This page was built for person: Holger Dell