Suivre
Holger Dell
Holger Dell
Adresse e-mail validée de uni-frankfurt.de - Page d'accueil
Titre
Citée par
Citée par
Année
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
3042014
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
2152016
Kernelization of packing problems
H Dell, D Marx
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1072012
Homomorphisms are a good basis for counting small subgraphs
R Curticapean, H Dell, D Marx
Symposium on Theory of Computing (STOC), 210-223, 2017
972017
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
822018
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
762014
Lov\'asz Meets Weisfeiler and Leman
H Dell, M Grohe, G Rattan
arXiv preprint arXiv:1802.08876, 2018
542018
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
482017
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
372018
Complexity of the cover polynomial
M Bläser, H Dell
International Colloquium on Automata, Languages, and Programming (ICALP …, 2007
362007
Extensor-coding
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
342018
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
242022
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
242015
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
242010
Fine-grained reductions from approximate counting to decision
H Dell, J Lapinskas
ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021
212021
Counting answers to existential questions
H Dell, M Roth, P Wellnitz
arXiv preprint arXiv:1902.04960, 2019
192019
Finding detours is fixed-parameter tractable
I Bezáková, R Curticapean, H Dell, FV Fomin
arXiv preprint arXiv:1607.07737, 2016
132016
Fine-grained dichotomies for the Tutte plane and Boolean #CSP
C Brand, H Dell, M Roth
arXiv preprint arXiv:1606.06581, 2016
132016
Complexity of the Bollobás-Riordan polynomial
M Bläser, H Dell, JA Makowsky
International Computer Science Symposium in Russia, 86-98, 2008
122008
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
112019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20