Holger Dell

Citata da

	Tutte	Dal 2019
Citazioni	1719	1096
Indice H	17	15
i10-index	22	17

200

100

150

2008200920102011201220132014201520162017201820192020202120222023202411 4 24 36 60 54 71 71 70 74 133 197 175 167 183 183 191

Accesso pubblico

Visualizza tutto

20 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Radu CurticapeanIT University of CopenhagenEmail verificata su itu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail verificata su cispa.saarland
Jesper NederlofUtrecht UniversityEmail verificata su uu.nl
Thore HusfeldtIT University of CopenhagenEmail verificata su itu.dk
John LapinskasLecturer in Computer Science, University of BristolEmail verificata su bristol.ac.uk
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyEmail verificata su cs.uni-saarland.de
Christian KomusiewiczFriedrich-Schiller-Universität JenaEmail verificata su uni-jena.de
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonEmail verificata su qmul.ac.uk
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityEmail verificata su informatik.rwth-aachen.de
Marek CyganUniversity of WarsawEmail verificata su mimuw.edu.pl
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Daniel LokshtanovProfessor of Computer Science, UCSBEmail verificata su ucsb.edu
Magnus WahlströmRoyal Holloway, University of LondonEmail verificata su rhul.ac.uk
Saket SaurabhProfessor at Institute of Mathematical SciencesEmail verificata su imsc.res.in
Kitty MeeksUniversity of GlasgowEmail verificata su glasgow.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no
Cornelius BrandRegensburg UniversityEmail verificata su informatik.uni-regensburg.de
Amir AbboudWeizmann Institute of ScienceEmail verificata su weizmann.ac.il
Karl BringmannProfessor in Computer Science, Saarland UniversityEmail verificata su cs.uni-saarland.de
Nimrod TalmonBen-Gurion UniversityEmail verificata su bgu.ac.il

Segui

Holger Dell

Goethe University Frankfurt

Email verificata su uni-frankfurt.de - Home page

Algorithms Complexity Theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	332	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	254	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	157	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	126	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	114	2018
Lov\'asz Meets Weisfeiler and Leman H Dell, M Grohe, G Rattan arXiv preprint arXiv:1802.08876, 2018	113	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	65	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	54	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	39	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	31	2021
Counting answers to existential questions H Dell, M Roth, P Wellnitz arXiv preprint arXiv:1902.04960, 2019	31	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
Fine-grained dichotomies for the Tutte plane and Boolean #CSP C Brand, H Dell, M Roth arXiv preprint arXiv:1606.06581, 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	13	2013
Complexity of the Bollobás-Riordan polynomial M Bläser, H Dell, JA Makowsky International Computer Science Symposium in Russia, 86-98, 2008	13	2008
A Fixed-Parameter Perspective on #BIS R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas arXiv preprint arXiv:1702.05543, 2017	12	2017

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori