Holger Dell

Cited by

	All	Since 2020
Citations	1741	923
h-index	19	14
i10-index	22	15

200

100

150

20082009201020112012201320142015201620172018201920202021202220232024202511 4 24 36 59 54 71 71 70 74 133 197 175 166 181 182 199 20

Public access

View all

19 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Radu CurticapeanIT University of CopenhagenVerified email at itu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Thore HusfeldtIT University of CopenhagenVerified email at itu.dk
John LapinskasLecturer in Computer Science, University of BristolVerified email at bristol.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
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonVerified email at qmul.ac.uk
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
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
Kitty MeeksUniversity of GlasgowVerified email at glasgow.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Cornelius BrandRegensburg UniversityVerified email at informatik.uni-regensburg.de
Amir AbboudWeizmann Institute of ScienceVerified email at weizmann.ac.il
Karl BringmannProfessor in Computer Science, Saarland UniversityVerified email at cs.uni-saarland.de
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il

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	335	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	258	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	159	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	127	2014
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	118	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	117	2018
Lovász meets Weisfeiler and Leman H Dell, M Grohe, G Rattan International Colloquium on Automata, Languages, and Programming (ICALP), 2018	115	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	67	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	57	2018
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	41	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	40	2022
Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming (ICALP …, 2007	36	2007
Fine-grained reductions from approximate counting to decision H Dell, J Lapinskas ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021	32	2021
Counting answers to existential questions H Dell, M Roth, P Wellnitz arXiv preprint arXiv:1902.04960, 2019	32	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	28	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	26	2015
AND-compression of NP-complete problems: Streamlined proof and minor observations H Dell Algorithmica 75 (2), 403-423, 2016	21*	2016
Fine-grained dichotomies for the Tutte plane and Boolean #CSP C Brand, H Dell, M Roth arXiv preprint arXiv:1606.06581, 2016	20	2016
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	20	2010
Is Valiant–Vazirani’s isolation probability improvable? H Dell, V Kabanets, D van Melkebeek, O Watanabe Computational Complexity 22 (2), 345–383, 2013	19*	2013

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