Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Holger Dell, D. Melkebeek
- Mathematics, Computer Science
- STOC '10
- 5 June 2010
TLDR
On Problems as Hard as CNF-SAT
- M. Cygan, Holger Dell, +6 authors Magnus Wahlstrom
- Computer Science
- IEEE 27th Conference on Computational Complexity
- 10 December 2011
TLDR
Kernelization of packing problems
- Holger Dell, D. Marx
- Computer Science, Mathematics
- SODA
- 17 January 2012
TLDR
Homomorphisms are a good basis for counting small subgraphs
- Radu Curticapean, Holger Dell, D. Marx
- Computer Science, Mathematics
- STOC
- 3 May 2017
TLDR
Exponential Time Complexity of the Permanent and the Tutte Polynomial
- Holger Dell, T. Husfeldt, D. Marx, Nina Taslaman, M. Wahlen
- Mathematics, Computer Science
- TALG
- 8 June 2012
TLDR
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
- Holger Dell, Christian Komusiewicz, Nimrod Talmon, M. Weller
- Mathematics, Computer Science
- IPEC
- 2017
TLDR
The First Parameterized Algorithms and Computational Experiments Challenge
- Holger Dell, T. Husfeldt, B. Jansen, P. Kaski, Christian Komusiewicz, Frances A. Rosamond
- Computer Science
- IPEC
- 1 February 2017
TLDR
Fine-grained reductions from approximate counting to decision
- Holger Dell, John Lapinskas
- Mathematics, Computer Science
- STOC
- 14 July 2017
TLDR
Complexity of the Cover Polynomial
- M. Bläser, Holger Dell
- Mathematics, Computer Science
- ICALP
- 9 July 2007
TLDR
Lovász Meets Weisfeiler and Leman
- Holger Dell, Martin Grohe, Gaurav Rattan
- Mathematics, Computer Science
- ICALP
- 1 February 2018
TLDR
...
1
2
3
4
5
...