Holger Dell - Google Scholar Citations

Cited by

	All	Since 2015
Citations	813	546
h-index	13	11
i10-index	15	12

200

100

150

200820092010201120122013201420152016201720182019202011 4 25 35 50 62 73 69 64 71 138 186 14

Co-authors

Dániel MarxInstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)Verified email at cs.bme.hu
Thore HusfeldtIT University of Copenhagen and Lund UniversityVerified email at itu.dk
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Radu CurticapeanBasic Algorithms Research Copenhagen, IT University of CopenhagenVerified email at itu.dk
Jesper NederlofTechnische Universiteit EindhovenVerified email at tue.nl
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
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
Cornelius BrandSaarland UniversityVerified email at mmci.uni-saarland.de
Marc RothMerton College, Oxford UniversityVerified email at merton.ox.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Johann (Janos) A. MakowskyFaculty of Computer Science, Technion - Israel Institute of Technology, Haifa, IsraelVerified email at cs.technion.ac.il
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
John LapinskasResearch Assistant in Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no

Holger Dell

IT University of Copenhagen

Verified email at itu.dk - Homepage

Algorithms Complexity Theory


Title	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	241	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	241*	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), 41, 2016	149	2016
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	81	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	43	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	36	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	34	2018
Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming (ICALP …, 2007	33	2007
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	28	2017
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	17	2010
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	15	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	15*	2018
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	15	2015
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	13	2018
Lov\'asz Meets Weisfeiler and Leman H Dell, M Grohe, G Rattan arXiv preprint arXiv:1802.08876, 2018	13	2018
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
Is Valiant–Vazirani’s isolation probability improvable? H Dell, V Kabanets, D van Melkebeek, O Watanabe computational complexity 22 (2), 345-383, 2013	11*	2013
Fine-grained reductions from approximate counting to decision H Dell, J Lapinskas Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	9	2018
AND-compression of NP-complete problems: Streamlined proof and minor observations H Dell Algorithmica 75 (2), 403-423, 2016	9	2016
A simple proof that AND-compression of NP-complete problems is hard. H Dell Electronic Colloquium on Computational Complexity (ECCC) 21, 75, 2014	8	2014

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

Upload PDF

Follow this author

Cited by

Co-authors