Articoli con mandati relativi all'accesso pubblico - Holger DellUlteriori informazioni
Disponibili pubblicamente: 20
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
Mandati: German Research Foundation
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
Mandati: US National Science Foundation, Netherlands Organisation for Scientific …
Homomorphisms are a good basis for counting small subgraphs
R Curticapean, H Dell, D Marx
Symposium on Theory of Computing (STOC), 210-223, 2017
Mandati: European Commission
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
Mandati: European Commission
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
Mandati: Netherlands Organisation for Scientific Research
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
Mandati: Netherlands Organisation for Scientific Research
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
Mandati: Netherlands Organisation for Scientific Research
Extensor-coding
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandati: Villum Foundation, Swedish Research Council
Fine-grained reductions from approximate counting to decision
H Dell, J Lapinskas
ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021
Mandati: European Commission
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
Mandati: US National Science Foundation, Villum Foundation, European Commission …
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
Mandati: Swedish Research Council
Complexity of the Bollobás-Riordan polynomial
M Bläser, H Dell, JA Makowsky
International Computer Science Symposium in Russia, 86-98, 2008
Mandati: German Research Foundation
A Fixed-Parameter Perspective on #BIS
R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas
arXiv preprint arXiv:1702.05543, 2017
Mandati: Villum Foundation, European Commission
Complexity and approximability of the cover polynomial
M Bläser, H Dell, M Fouz
computational complexity 21, 359-419, 2012
Mandati: German Research Foundation
The exponential-time complexity of counting (quantum) graph homomorphisms
H Chen, R Curticapean, H Dell
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
Mandati: Villum Foundation, European Commission
Complexity and approximability of parameterized max-csps
H Dell, EJ Kim, M Lampis, V Mitsou, T Mömke
Algorithmica 79, 230-250, 2017
Mandati: German Research Foundation, European Commission
Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions
M Bläser, H Dell, JA Makowsky
Theory of Computing Systems 46 (4), 690-706, 2010
Mandati: German Research Foundation
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)
A Leonhardt, H Dell, A Haak, F Kammer, J Meintrup, U Meyer, ...
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
Mandati: German Research Foundation
Counting edge-injective homomorphisms and matchings on restricted graph classes
R Curticapean, H Dell, M Roth
Theory of Computing Systems 63 (5), 987-1026, 2019
Mandati: Villum Foundation, European Commission
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
Mandati: Netherlands Organisation for Scientific Research
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software