Holger Dell
Holger Dell
IT University of Copenhagen
Bestätigte E-Mail-Adresse bei itu.dk - Startseite
TitelZitiert vonJahr
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
H Dell, D Van Melkebeek
Journal of the ACM (JACM) 61 (4), 23, 2014
2352014
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
H Dell, D Van Melkebeek
Proceedings of the forty-second ACM symposium on Theory of computing, 251-260, 2010
235*2010
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 41, 2016
1342016
Kernelization of packing problems
H Dell, D Marx
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
742012
Complexity of the cover polynomial
M Bläser, H Dell
International Colloquium on Automata, Languages, and Programming (ICALP …, 2007
322007
Homomorphisms are a good basis for counting small subgraphs
R Curticapean, H Dell, D Marx
Symposium on Theory of Computing (STOC), 210-223, 2017
292017
Exponential time complexity of the permanent and the Tutte polynomial
H Dell, T Husfeldt, D Marx, N Taslaman, M Wahlén
ACM Transactions on Algorithms (TALG) 10 (4), 21, 2014
282014
The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration
H Dell, C Komusiewicz, N Talmon, M Weller
LIPIcs-Leibniz International Proceedings in Informatics 89, 2018
212018
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
202017
Exponential time complexity of the permanent and the Tutte polynomial
H Dell, T Husfeldt, M Wahlén
International Colloquium on Automata, Languages, and Programming, 426-437, 2010
152010
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
A Björklund, H Dell, T Husfeldt
ICALP (1), 231-242, 2015
132015
Is Valiant–Vazirani’s isolation probability improvable?
H Dell, V Kabanets, D van Melkebeek, O Watanabe
computational complexity 22 (2), 345-383, 2013
11*2013
Complexity of the Bollobás-Riordan polynomial
M Bläser, H Dell, JA Makowsky
International Computer Science Symposium in Russia, 86-98, 2008
112008
A simple proof that AND-compression of NP-complete problems is hard.
H Dell
Electronic Colloquium on Computational Complexity (ECCC) 21, 75, 2014
82014
More consequences of falsifying SETH and the orthogonal vectors conjecture
A Abboud, K Bringmann, H Dell, J Nederlof
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
72018
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture [Full version]
A Abboud, K Bringmann, H Dell, J Nederlof
proceedings of STOC 2018, 2018
7*2018
AND-compression of NP-complete problems: Streamlined proof and minor observations
H Dell
Algorithmica 75 (2), 403-423, 2016
72016
Fine-grained reductions from approximate counting to decision
H Dell, J Lapinskas
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
62018
Lov\'asz Meets Weisfeiler and Leman
H Dell, M Grohe, G Rattan
arXiv preprint arXiv:1802.08876, 2018
62018
Finding detours is fixed-parameter tractable
I Bezáková, R Curticapean, H Dell, FV Fomin
arXiv preprint arXiv:1607.07737, 2016
62016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20