Holger Dell
Holger Dell
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
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
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), 1-24, 2016
Homomorphisms are a good basis for counting small subgraphs
R Curticapean, H Dell, D Marx
Symposium on Theory of Computing (STOC), 210-223, 2017
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
Kernelization of packing problems
H Dell, D Marx
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
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
Lov\'asz Meets Weisfeiler and Leman
H Dell, M Grohe, G Rattan
arXiv preprint arXiv:1802.08876, 2018
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
International Symposium on Parameterized and Exact Computation, 1-9, 2017
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
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Approximately counting and sampling small witnesses using a colorful decision oracle
H Dell, J Lapinskas, K Meeks
SIAM Journal on Computing 51 (4), 849-899, 2022
Complexity of the cover polynomial
M Bläser, H Dell
International Colloquium on Automata, Languages, and Programming (ICALP …, 2007
Fine-grained reductions from approximate counting to decision
H Dell, J Lapinskas
ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021
Counting answers to existential questions
H Dell, M Roth, P Wellnitz
arXiv preprint arXiv:1902.04960, 2019
Finding detours is fixed-parameter tractable
I Bezáková, R Curticapean, H Dell, FV Fomin
SIAM Journal on Discrete Mathematics 33 (4), 2326-2345, 2019
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
Fine-grained dichotomies for the Tutte plane and Boolean #CSP
C Brand, H Dell, M Roth
arXiv preprint arXiv:1606.06581, 2016
Is Valiant–Vazirani’s isolation probability improvable?
H Dell, V Kabanets, D van Melkebeek, O Watanabe
computational complexity 22 (2), 345-383, 2013
A Fixed-Parameter Perspective on #BIS
R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas
arXiv preprint arXiv:1702.05543, 2017
Complexity of the Bollobás-Riordan polynomial
M Bläser, H Dell, JA Makowsky
International Computer Science Symposium in Russia, 86-98, 2008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20