Holger Dell

Holger Dell

Goethe University Frankfurt - Frankfurt / Germany
Engineering & Technology / Computer Science
AD Scientific Index ID: 1453336
Goethe-Universität Frankfurt
person_outline Holger Dell's MOST POPULAR ARTICLES
1-) Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapsesH Dell, D Van MelkebeekJournal of the ACM (JACM) 61 (4), 23, 20143032014
2-) On problems as hard as CNF-SATM Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 20162152016
3-) Homomorphisms are a good basis for counting small subgraphsR Curticapean, H Dell, D MarxSymposium on Theory of Computing (STOC), 210-223, 20171092017
4-) Exponential time complexity of the permanent and the Tutte polynomialH Dell, T Husfeldt, D Marx, N Taslaman, M WahlénACM Transactions on Algorithms (TALG) 10 (4), 21, 20141252014
5-) Kernelization of packing problemsH Dell, D MarxProceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 20121182012