Holger Dell

Citée par

	Toutes	Depuis 2020
Citations	1752	926
indice h	19	14
indice i10	23	16

200

100

150

20082009201020112012201320142015201620172018201920202021202220232024202510 4 24 37 62 56 71 72 71 74 132 197 178 165 177 181 194 31

Accès public

Tout afficher

19 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Radu CurticapeanIT University of CopenhagenAdresse e-mail validée de itu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityAdresse e-mail validée de cispa.saarland
Thore HusfeldtIT University of CopenhagenAdresse e-mail validée de itu.dk
Jesper NederlofUtrecht UniversityAdresse e-mail validée de uu.nl
John LapinskasLecturer in Computer Science, University of BristolAdresse e-mail validée de bristol.ac.uk
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyAdresse e-mail validée de cs.uni-saarland.de
Christian KomusiewiczFriedrich-Schiller-Universität JenaAdresse e-mail validée de uni-jena.de
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonAdresse e-mail validée de qmul.ac.uk
Marek CyganUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Yoshio OkamotoUniversity of Electro-CommunicationsAdresse e-mail validée de uec.ac.jp
Daniel LokshtanovProfessor of Computer Science, UCSBAdresse e-mail validée de ucsb.edu
Magnus WahlströmRoyal Holloway, University of LondonAdresse e-mail validée de rhul.ac.uk
Saket SaurabhProfessor at Institute of Mathematical SciencesAdresse e-mail validée de imsc.res.in
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityAdresse e-mail validée de informatik.rwth-aachen.de
Kitty MeeksUniversity of GlasgowAdresse e-mail validée de glasgow.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenAdresse e-mail validée de uib.no
Cornelius BrandRegensburg UniversityAdresse e-mail validée de informatik.uni-regensburg.de
Amir AbboudWeizmann Institute of ScienceAdresse e-mail validée de weizmann.ac.il
Karl BringmannProfessor in Computer Science, Saarland UniversityAdresse e-mail validée de cs.uni-saarland.de
Nimrod TalmonBen-Gurion UniversityAdresse e-mail validée de bgu.ac.il

Suivre

Holger Dell

Goethe University Frankfurt

Adresse e-mail validée de uni-frankfurt.de - Page d'accueil

Algorithms Complexity Theory


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	336	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	261	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	162	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	125	2014
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	118	2012
Lovász meets Weisfeiler and Leman H Dell, M Grohe, G Rattan International Colloquium on Automata, Languages, and Programming (ICALP), 2018	115	2018
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	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	68	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	56	2018
Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	44	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	41	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	33	2021
Counting answers to existential questions H Dell, M Roth, P Wellnitz arXiv preprint arXiv:1902.04960, 2019	33	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	30	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
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	21	2010
Fine-grained dichotomies for the Tutte plane and Boolean #CSP C Brand, H Dell, M Roth arXiv preprint arXiv:1606.06581, 2016	20	2016
AND-compression of NP-complete problems: Streamlined proof and minor observations H Dell Algorithmica 75 (2), 403-423, 2016	20*	2016
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs