Holger Dell

Cited by

	All	Since 2018
Citations	1436	948
h-index	16	14
i10-index	21	17

200

100

150

20082009201020112012201320142015201620172018201920202021202220238 2 26 36 61 55 70 70 71 75 126 184 174 175 189 93

Public access

View all

17 articles

1 article

available

not available

Based on funding mandates

Co-authors

Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Radu CurticapeanIT University of CopenhagenVerified email at itu.dk
Thore HusfeldtIT University of Copenhagen and Lund UniversityVerified email at itu.dk
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Marc RothDepartment of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Christian KomusiewiczFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
John LapinskasResearch Assistant in Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Cornelius BrandTU WienVerified email at iuuk.mff.cuni.cz
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Kitty MeeksUniversity of GlasgowVerified email at glasgow.ac.uk
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Gaurav RattanResearcher, TU DarmstadtVerified email at mathematik.tu-darmstadt.de

Holger Dell

Goethe University Frankfurt

Verified email at uni-frankfurt.de - Homepage

Algorithms Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	310	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	219	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	112	2017
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	107	2012
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	104	2014
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	91	2018
Lov\'asz Meets Weisfeiler and Leman H Dell, M Grohe, G Rattan arXiv preprint arXiv:1802.08876, 2018	69	2018
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	55	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	40	2018
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	38	2018
Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming (ICALP …, 2007	35	2007
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	33	2022
Fine-grained reductions from approximate counting to decision H Dell, J Lapinskas ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021	25	2021
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	25	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	25	2015
Counting answers to existential questions H Dell, M Roth, P Wellnitz arXiv preprint arXiv:1902.04960, 2019	22	2019
Fine-grained dichotomies for the Tutte plane and Boolean #CSP C Brand, H Dell, M Roth arXiv preprint arXiv:1606.06581, 2016	14	2016
AND-compression of NP-complete problems: Streamlined proof and minor observations H Dell Algorithmica 75 (2), 403-423, 2016	12	2016
Complexity of the Bollobás-Riordan polynomial M Bläser, H Dell, JA Makowsky International Computer Science Symposium in Russia, 86-98, 2008	12	2008
A Fixed-Parameter Perspective on #BIS R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas arXiv preprint arXiv:1702.05543, 2017	11	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors