Jesper Nederlof
Jesper Nederlof
Technische Universiteit Eindhoven
Geverifieerd e-mailadres voor tue.nl - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2992011
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
1842015
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
1632016
Fast polynomial-space algorithms using inclusion-exclusion
J Nederlof
Algorithmica 65 (4), 868-884, 2013
141*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
1182015
Inclusion/exclusion meets measure and conquer
J Nederlof, JMM van Rooij, TC van Dijk
Algorithmica 69 (3), 685-740, 2014
102*2014
Saving space by algebraization
D Lokshtanov, J Nederlof
Proceedings of the forty-second ACM symposium on Theory of computing, 321-330, 2010
842010
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
632013
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
222012
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
212018
Inclusion exclusion for hard problems
J Nederlof
Master's thesis, Utrecht University (August 2008), 2008
202008
Dense subset sum may be the hardest
P Austrin, M Koivisto, P Kaski, J Nederlof
arXiv preprint arXiv:1508.06019, 2015
192015
Fast Hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Journal of the ACM (JACM) 65 (3), 1-46, 2018
182018
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
182015
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
182010
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
172015
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
152015
Homomorphic hashing for sparse coefficient extraction
P Kaski, M Koivisto, J Nederlof
International Symposium on Parameterized and Exact Computation, 147-158, 2012
152012
Speeding up dynamic programming with representative sets
S Fafianie, HL Bodlaender, J Nederlof
International Symposium on Parameterized and Exact Computation, 321-334, 2013
132013
Subexponential time algorithms for embedding H-minor free graphs
HL Bodlaender, J Nederlof, TC van der Zanden
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
122016
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20