Sledovat
Jesper Nederlof
Jesper Nederlof
Utrecht University
E-mailová adresa ověřena na: uu.nl - Domovská stránka
Název
Citace
Citace
Rok
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
430*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
3112015
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
2632016
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
2422015
Fast polynomial-space algorithms using inclusion-exclusion: Improving on Steiner tree and related problems
J Nederlof
Algorithmica 65 (4), 868-884, 2013
191*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
1422018
Inclusion/exclusion meets measure and conquer
J Nederlof, JMM van Rooij, TC van Dijk
Algorithmica 69, 685-740, 2014
120*2014
Saving space by algebraization
D Lokshtanov, J Nederlof
Proceedings of the Forty-second ACM Symposium on Theory of Computing, 321-330, 2010
1052010
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
562018
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
522022
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
392015
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
372015
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
352015
Inclusion exclusion for hard problems
J Nederlof
Master's thesis, Utrecht University, Utrecht, The Netherlands, 2008
332008
Parameterized problems complete for nondeterministic FPT time and logarithmic space
HL Bodlaender, C Groenland, J Nederlof, C Swennenhuis
Information and Computation 300, 105195, 2024
322024
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
302018
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81, 3993-4009, 2019
282019
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
282012
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
272018
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20