Scholar
Jesper Nederlof
Google Scholar ID: waGEU2cAAAAJ
Utrecht University
Algorithms
Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,360
H-index
21
i10-index
33
Publications
20
Co-authors
47
list available
Publications
6 items
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
2026
Cited
0
Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
2026
Cited
0
An Invitation to "Fine-grained Complexity of NP-Complete Problems"
arXiv.org · 2026
Cited
0
Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
2025
Cited
0
Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
2025
Cited
0
Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
2025
Cited
0
Co-authors
16 total
Marek Cygan
University of Warsaw
Hans L. Bodlaender
Professor Computer Science, Utrecht University
Michał Pilipczuk
University of Warsaw
Daniel Lokshtanov
Professor of Computer Science, UCSB
Petteri Kaski
Assistant Professor of Computer Science, Aalto University
Stefan Kratsch
Professor at Humboldt University Berlin
Holger Dell
IT University of Copenhagen
Nikhil Bansal
University of Michigan
