Jesper Nederlof

Cited by

	All	Since 2020
Citations	2375	1165
h-index	22	18
i10-index	39	30

280

140

210

2008200920102011201220132014201520162017201820192020202120222023202420256 15 34 50 77 98 122 124 110 142 192 217 201 203 203 246 265 40

Public access

View all

32 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Verified email at uu.nl
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Holger DellGoethe University FrankfurtVerified email at uni-frankfurt.de
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityVerified email at aalto.fi
Mikko KoivistoProfessor, University of HelsinkiVerified email at helsinki.fi
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Per AustrinAssociate Professor in Computer Science, KTH Royal Institute of TechnologyVerified email at kth.se
Thomas C. van DijkTU EindhovenVerified email at tue.nl
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.nl
Amir AbboudWeizmann Institute of ScienceVerified email at weizmann.ac.il

Jesper Nederlof

Utrecht University

Verified email at uu.nl - Homepage

Algorithms Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Solving connectivity problems parameterized by treewidth in single exponential time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ... 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011	417	2011
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth HL Bodlaender, M Cygan, S Kratsch, J Nederlof Information and Computation 243, 86-111, 2015	303	2015
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	257	2016
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth HL Bodlaender, M Cygan, S Kratsch, J Nederlof Information and Computation 243, 86-111, 2015	235	2015
Fast polynomial-space algorithms using inclusion-exclusion: Improving on Steiner tree and related problems J Nederlof Algorithmica 65 (4), 868-884, 2013	188*	2013
Fast hamiltonicity checking via bases of perfect matchings M Cygan, S Kratsch, J Nederlof Journal of the ACM (JACM) 65 (3), 1-46, 2018	140	2018
Inclusion/exclusion meets measure and conquer J Nederlof, JMM van Rooij, TC van Dijk Algorithmica 69, 685-740, 2014	117*	2014
Saving space by algebraization D Lokshtanov, J Nederlof Proceedings of the Forty-second ACM Symposium on Theory of Computing, 321-330, 2010	104	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	56	2018
Detecting Feedback Vertex Sets of Size k in O^⋆ (2.7k) Time J Li, J Nederlof ACM Transactions on Algorithms (TALG) 18 (4), 1-26, 2022	52	2022
Faster Space-Efficient Algorithms for Subset Sum, -Sum, and Related Problems N Bansal, S Garg, J Nederlof, N Vyas SIAM Journal on Computing 47 (5), 1755-1777, 2018	44*	2018
Dense subset sum may be the hardest P Austrin, M Koivisto, P Kaski, J Nederlof arXiv preprint arXiv:1508.06019, 2015	39	2015
Fast zeta transforms for lattices with few irreducibles A Björklund, T Husfeldt, P Kaski, M Koivisto, J Nederlof, P Parviainen ACM Transactions on Algorithms (TALG) 12 (1), 1-19, 2015	36	2015
Subset sum in the absence of concentration P Austrin, P Kaski, M Koivisto, J Nederlof 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015	35	2015
Inclusion exclusion for hard problems J Nederlof Master's thesis, Utrecht University, Utrecht, The Netherlands, 2008	32	2008
Parameterized problems complete for nondeterministic FPT time and logarithmic space HL Bodlaender, C Groenland, J Nederlof, C Swennenhuis Information and Computation 300, 105195, 2024	30	2024
A tight lower bound for counting Hamiltonian cycles via matrix rank R Curticapea, N Lindzey, J Nederlof Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	29	2018
On directed feedback vertex set parameterized by treewidth M Bonamy, Ł Kowalik, J Nederlof, M Pilipczuk, A Socała, M Wrochna Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018	28	2018
Reducing a target interval to a few exact queries J Nederlof, EJ van Leeuwen, R van der Zwaan International Symposium on Mathematical Foundations of Computer Science, 718-727, 2012	28	2012
Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs P Heggernes, D Lokshtanov, J Nederlof, C Paul, JA Telle Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010	26	2010

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

Follow

Cited by

Co-authors