Holger Dell

Navedeno

	Vse	Od leta 2020
Navedbe	1755	929
indeks h	19	14
indeks i10	23	16

200

100

150

20082009201020112012201320142015201620172018201920202021202220232024202510 4 24 37 62 56 71 72 71 74 132 197 178 165 175 181 193 37

Javni dostop

Prikaži vse

19 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Radu CurticapeanIT University of CopenhagenPreverjeni e-poštni naslov na itu.dk
Dániel MarxCISPA Helmholtz Center for Information SecurityPreverjeni e-poštni naslov na cispa.saarland
Thore HusfeldtIT University of CopenhagenPreverjeni e-poštni naslov na itu.dk
Jesper NederlofUtrecht UniversityPreverjeni e-poštni naslov na uu.nl
John LapinskasLecturer in Computer Science, University of BristolPreverjeni e-poštni naslov na bristol.ac.uk
Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyPreverjeni e-poštni naslov na cs.uni-saarland.de
Christian KomusiewiczFriedrich-Schiller-Universität JenaPreverjeni e-poštni naslov na uni-jena.de
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonPreverjeni e-poštni naslov na qmul.ac.uk
Marek CyganUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Yoshio OkamotoUniversity of Electro-CommunicationsPreverjeni e-poštni naslov na uec.ac.jp
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Magnus WahlströmRoyal Holloway, University of LondonPreverjeni e-poštni naslov na rhul.ac.uk
Cornelius BrandRegensburg UniversityPreverjeni e-poštni naslov na informatik.uni-regensburg.de
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityPreverjeni e-poštni naslov na informatik.rwth-aachen.de
Kitty MeeksUniversity of GlasgowPreverjeni e-poštni naslov na glasgow.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Amir AbboudWeizmann Institute of SciencePreverjeni e-poštni naslov na weizmann.ac.il
Karl BringmannProfessor in Computer Science, Saarland UniversityPreverjeni e-poštni naslov na cs.uni-saarland.de
Nimrod TalmonBen-Gurion UniversityPreverjeni e-poštni naslov na bgu.ac.il

Spremljaj

Holger Dell

Goethe University Frankfurt

Preverjeni e-poštni naslov na uni-frankfurt.de - Domača stran

Algorithms Complexity Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	263	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	45	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji