Holger Dell - Google Scholar Citations

Cited by

	All	Since 2014
Citations	734	540
h-index	11	10
i10-index	13	10

140

105

20072008200920102011201220132014201520162017201820192 11 4 25 35 50 62 71 69 66 75 132 124

Co-authors

Dániel MarxInstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)Verified email at cs.bme.hu
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Thore HusfeldtIT University of Copenhagen and Lund UniversityVerified 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
Marc RothPhD student in Computer Science, Saarland University and Cluster of Excellence (MMCI)Verified email at mmci.uni-saarland.de
Johann (Janos) A. MakowskyFaculty of Computer Science, Technion - Israel Institute of Technology, Haifa, IsraelVerified email at cs.technion.ac.il
Osamu WatanabeProfessor of Mathematical and Computing Sciences, Tokyo Institute of TechnologyVerified email at is.titech.ac.jp
Cornelius BrandSaarland UniversityVerified email at mmci.uni-saarland.de
John LapinskasResearch Assistant in Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityVerified email at aalto.fi

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	236	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	236*	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	139	2016
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	76	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	33	2017
Complexity of the cover polynomial M Bläser, H Dell International Colloquium on Automata, Languages, and Programming (ICALP …, 2007	32	2007
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	30	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	25	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	23	2017
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
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	15	2010
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
Complexity of the Bollobás-Riordan polynomial M Bläser, H Dell, JA Makowsky International Computer Science Symposium in Russia, 86-98, 2008	11	2008
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	10	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	10*	2018
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	8	2018
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
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	7	2018
Lov\'asz Meets Weisfeiler and Leman H Dell, M Grohe, G Rattan arXiv preprint arXiv:1802.08876, 2018	7	2018
AND-compression of NP-complete problems: Streamlined proof and minor observations H Dell Algorithmica 75 (2), 403-423, 2016	7	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

Upload PDF

Follow this author

Cited by

Co-authors