Follow
Jesper Nederlof
Jesper Nederlof
Verified email at uu.nl - Homepage
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
3432011
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
2292015
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
2022016
Fast polynomial-space algorithms using inclusion-exclusion
J Nederlof
Algorithmica 65 (4), 868-884, 2013
167*2013
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
1622015
Inclusion/exclusion meets measure and conquer
J Nederlof, JMM van Rooij, TC van Dijk
Algorithmica 69 (3), 685-740, 2014
109*2014
Saving space by algebraization
D Lokshtanov, J Nederlof
Proceedings of the Forty-second ACM Symposium on Theory of Computing, 321-330, 2010
962010
Fast hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
702013
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
362018
Fast Hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Journal of the ACM (JACM) 65 (3), 1-46, 2018
322018
Dense subset sum may be the hardest
P Austrin, M Koivisto, P Kaski, J Nederlof
arXiv preprint arXiv:1508.06019, 2015
272015
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
J Li, J Nederlof
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
262020
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
262015
Reducing a target interval to a few exact queries
J Nederlof, EJ Leeuwen, R Zwaan
International Symposium on Mathematical Foundations of Computer Science, 718-727, 2012
262012
Generalized graph clustering: recognizing (p, q)-cluster graphs
P Heggernes, D Lokshtanov, J Nederlof, C Paul, JA Telle
International Workshop on Graph-Theoretic Concepts in Computer Science, 171-183, 2010
242010
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
232015
Inclusion exclusion for hard problems
J Nederlof
Master's thesis, Utrecht University (August 2008), 2008
232008
Faster space-efficient algorithms for subset sum and k-sum
N Bansal, S Garg, J Nederlof, N Vyas
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
192017
Speeding up dynamic programming with representative sets: An experimental evaluation of algorithms for steiner tree on tree decompositions
S Fafianie, HL Bodlaender, J Nederlof
Algorithmica 71 (3), 636-660, 2015
192015
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81 (10), 3993-4009, 2019
162019
The system can't perform the operation now. Try again later.
Articles 1–20