Holger Dell

Cited by

	All	Since 2017
Citations	1259	847
h-index	16	14
i10-index	21	16

200

100

150

2008200920102011201220132014201520162017201820192020202120229 4 25 36 53 60 73 69 69 76 132 185 184 192 74

Public access

View all

19 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Radu CurticapeanIT University of Copenhagen, Basic Algorithms Research CopenhagenVerified email at itu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
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 merton.ox.ac.uk
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Daniel LokshtanovAssociate Professor in 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
John LapinskasResearch Assistant in Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Cornelius BrandTU WienVerified email at iuuk.mff.cuni.cz
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityVerified email at aalto.fi

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	294	2014
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses H Dell, D Van Melkebeek Proceedings of the forty-second ACM symposium on Theory of computing, 251-260, 2010	294*	2010
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	201	2016
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	101	2012
Homomorphisms are a good basis for counting small subgraphs R Curticapean, H Dell, D Marx Symposium on Theory of Computing (STOC), 210-223, 2017	92	2017
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	73	2018
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	70	2014
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	49	2017
Lov\'asz Meets Weisfeiler and Leman H Dell, M Grohe, G Rattan arXiv preprint arXiv:1802.08876, 2018	44	2018
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	36	2018
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	36*	2018
Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming (ICALP …, 2007	36	2007
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	31	2018
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	24	2010
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	23	2015
Approximately counting and sampling small witnesses using a colourful decision oracle H Dell, J Lapinskas, K Meeks Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	21	2020
Fine-grained reductions from approximate counting to decision H Dell, J Lapinskas ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021	20	2021
Is Valiant–Vazirani’s isolation probability improvable? H Dell, V Kabanets, D van Melkebeek, O Watanabe computational complexity 22 (2), 345-383, 2013	16*	2013
Counting answers to existential questions H Dell, M Roth, P Wellnitz arXiv preprint arXiv:1902.04960, 2019	15	2019
Fine-grained dichotomies for the Tutte plane and Boolean #CSP C Brand, H Dell, M Roth arXiv preprint arXiv:1606.06581, 2016	13	2016

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 this author

Cited by

Co-authors