Jesper Nederlof

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 88

Top Venues

CoRR

ESA

ACM Trans. Algorithms

STOC

Publications

Andreas Björklund, Petteri Kaski, Jesper Nederlof
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP (2024)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300 (2024)
Jesper Nederlof, Krisztina Szilágyi
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. SOFSEM (2024)
Ivan Bliznets, Jesper Nederlof
Exact and Parameterized Algorithms for Choosability. SOFSEM (2024)
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP (2024)
Andreas Björklund, Petteri Kaski, Jesper Nederlof
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR (2023)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. 37 (3) (2023)
Isja Mannens, Jesper Nederlof
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. CoRR (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS (2023)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR (2023)
Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA (2023)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30 (3) (2023)
Isja Mannens, Jesper Nederlof
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. ESA (2023)
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
-Server in Uniform Metrics. ACM Trans. Algorithms 19 (1) (2023)
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR (2023)
Jesper Nederlof, Krisztina Szilágyi
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. CoRR (2023)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. 52 (6) (2023)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding generalized coloring numbers of planar graphs using coin models. CoRR (2022)
Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS (2022)
Jesper Nederlof, Céline M. F. Swennenhuis
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica 84 (8) (2022)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2022)
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms 18 (2) (2022)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2022)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR (2022)
Jason Li, Jesper Nederlof
) Time. ACM Trans. Algorithms 18 (4) (2022)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation Schemes for Problems on Decomposable Graphs. STACS (2022)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
) time. CoRR (2022)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA (2021)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR (2021)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation schemes for problems on decomposable graphs. CoRR (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR (2021)
Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. CoRR (2021)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2021)
Jesper Nederlof, Karol Wegrzycki
Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC (2021)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG (2021)
Jesper Nederlof
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication. STOC (2020)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR (2020)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR (2020)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG (2020)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR (2020)
Jason Li, Jesper Nederlof
) Time. SODA (2020)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16 (3) (2020)
Jesper Nederlof, Karol Wegrzycki
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR (2020)
Jesper Nederlof
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Treewidth, Kernels, and Algorithms (2020)
Jesper Nederlof
Detecting and counting small patterns in planar graphs in subexponential parameterized time. STOC (2020)
Jesper Nederlof, Céline M. F. Swennenhuis
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. IPEC (2020)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR (2019)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity Below Dirac's Condition. WG (2019)
Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Complexity of Partial Scheduling. CoRR (2019)
Jason Li, Jesper Nederlof
Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time. CoRR (2019)
Jesper Nederlof
Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time. CoRR (2019)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA (2019)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA (2019)
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Hamiltonicity below Dirac's condition. CoRR (2019)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81 (10) (2019)
Bart M. P. Jansen, Jesper Nederlof
Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795 (2019)
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
-Server in Uniform Metrics. SODA (2018)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. 47 (5) (2018)
Bart M. P. Jansen, Jesper Nederlof
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR (2018)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR (2018)
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA (2018)
Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR (2018)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set Parameterized by Treewidth. WG (2018)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory 64 (2) (2018)
Bart M. P. Jansen, Jesper Nederlof
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA (2018)
Marek Cygan, Stefan Kratsch, Jesper Nederlof
Fast Hamiltonicity Checking Via Bases of Perfect Matchings. J. ACM 65 (3) (2018)
Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC (2018)
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR (2017)
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR (2017)
Jesper Nederlof
A short note on Merlin-Arthur protocols for subset sum. Inf. Process. Lett. 118 (2017)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set parameterized by treewidth. CoRR (2017)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster space-efficient algorithms for subset sum and k-sum. STOC (2017)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-time Approximation. CoRR (2017)
Jesper Nederlof
Finding Large Set Covers Faster via the Representation Method. CoRR (2016)
Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP (2016)
Hans L. Bodlaender, Jesper Nederlof
Subexponential time algorithms for finding small tree and path decompositions. CoRR (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR (2016)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12 (3) (2016)
Jesper Nederlof
A short note on Merlin-Arthur protocols for subset sum. CoRR (2016)
Jesper Nederlof
Finding Large Set Covers Faster via the Representation Method. ESA (2016)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12 (1) (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT (2016)
Andrew Drucker, Jesper Nederlof, Rahul Santhanam
Exponential Time Paradigms Through the Polynomial Time Lens. ESA (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Dense Subset Sum May Be the Hardest. STACS (2016)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR (2016)
Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica 71 (3) (2015)
Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. 57 (1) (2015)
Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243 (2015)
Hans L. Bodlaender, Jesper Nederlof
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA (2015)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Subset Sum in the Absence of Concentration. STACS (2015)
Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof
Dense Subset Sum may be the hardest. CoRR (2015)
Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69 (3) (2014)
Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. CoRR (2013)
Jesper Nederlof
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Algorithmica 65 (4) (2013)
Marek Cygan, Stefan Kratsch, Jesper Nederlof
Fast hamiltonicity checking via bases of perfect matchings. STOC (2013)
Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
Minimizing Rosenthal Potential in Multicast Games. CoRR (2013)
Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ICALP (1) (2013)

Jesper Nederlof.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jesper Nederlof