| 2026 | ICALP | Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms. | Andreas Bjrklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof |
| 2026 | ICALP | Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-Width. | Kacper Kluk, Jesper Nederlof |
| 2025 | FOCS | Weighted k-Path and Other Problems in Almost O | Jesper Nederlof |
| 2025 | SODA | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. | Jesper Nederlof, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2024 | ICALP | Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. | Andreas Bjrklund, Petteri Kaski, Jesper Nederlof |
| 2024 | ICALP | Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. | Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski |
| 2024 | SOFSEM | Exact and Parameterized Algorithms for Choosability. | Ivan Bliznets, Jesper Nederlof |
| 2024 | SOFSEM | Parameterized Algorithms for Covering by Arithmetic Progressions. | Ivan Bliznets, Jesper Nederlof, Krisztina Szilgyi |
| 2024 | SOFSEM | Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. | Jesper Nederlof, Krisztina Szilgyi |
| 2023 | ESA | Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. | Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo |
| 2023 | ESA | A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. | Isja Mannens, Jesper Nederlof |
| 2023 | STACS | Tight Lower Bounds for Problems Parameterized by Rank-Width. | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
| 2022 | STACS | Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. | Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilgyi |
| 2022 | STACS | Isolation Schemes for Problems on Decomposable Graphs. | Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2021 | FOCS | Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. | Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Cline M. F. Swennenhuis |
| 2021 | FOCS | A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. | Sndor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki |
| 2021 | SODA | A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. | Jesper Nederlof, Jakub Pawlewicz, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2021 | STOC | Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. | Jesper Nederlof, Karol Wegrzycki |
| 2021 | WG | On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. | Isja Mannens, Jesper Nederlof, Cline M. F. Swennenhuis, Krisztina Szilgyi |
| 2020 | SODA | Detecting Feedback Vertex Sets of Size | Jason Li, Jesper Nederlof |
| 2020 | STOC | Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication. | Jesper Nederlof |
| 2020 | STOC | Detecting and counting small patterns in planar graphs in subexponential parameterized time. | Jesper Nederlof |
| 2020 | WG | Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. | Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2019 | ESA | Equal-Subset-Sum Faster Than the Meet-in-the-Middle. | Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki |
| 2019 | SODA | Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. | Sndor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen |
| 2019 | WG | Hamiltonicity Below Dirac's Condition. | Bart M. P. Jansen, Lszl Kozma, Jesper Nederlof |
| 2018 | ESA | Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. | Bart M. P. Jansen, Jesper Nederlof |
| 2018 | SODA | Competitive Algorithms for Generalized | Nikhil Bansal, Marek Elis, Grigorios Koumoutsos, Jesper Nederlof |
| 2018 | SODA | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. | Radu Curticapean, Nathan Lindzey, Jesper Nederlof |
| 2018 | STOC | More consequences of falsifying SETH and the orthogonal vectors conjecture. | Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof |
| 2018 | WG | On Directed Feedback Vertex Set Parameterized by Treewidth. | Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | STOC | Faster space-efficient algorithms for subset sum and k-sum. | Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas |
| 2016 | ESA | Exponential Time Paradigms Through the Polynomial Time Lens. | Andrew Drucker, Jesper Nederlof, Rahul Santhanam |
| 2016 | ESA | Finding Large Set Covers Faster via the Representation Method. | Jesper Nederlof |
| 2016 | ICALP | Subexponential Time Algorithms for Embedding H-Minor Free Graphs. | Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden |
| 2016 | ISIT | Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2016 | STACS | Dense Subset Sum May Be the Hardest. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2015 | ESA | Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. | Hans L. Bodlaender, Jesper Nederlof |
| 2015 | STACS | Subset Sum in the Absence of Concentration. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2013 | ICALP | Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
| 2013 | STOC | Fast hamiltonicity checking via bases of perfect matchings. | Marek Cygan, Stefan Kratsch, Jesper Nederlof |
| 2012 | ICALP | Minimizing Rosenthal Potential in Multicast Games. | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk |
| 2012 | MFCS | Reducing a Target Interval to a Few Exact Queries. | Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan |
| 2012 | SODA | Fast zeta transforms for lattices with few irreducibles. | Andreas Bjrklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen |
| 2011 | FOCS | Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
| 2010 | CIAC | A Parameterized Algorithm for Chordal Sandwich. | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
| 2010 | STOC | Saving space by algebraization. | Daniel Lokshtanov, Jesper Nederlof |
| 2010 | WG | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2010 | WG | Generalized Graph Clustering: Recognizing ( | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2009 | ESA | Inclusion/Exclusion Meets Measure and Conquer. | Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk |
| 2009 | ICALP | Fast Polynomial-Space Algorithms Using Mbius Inversion: Improving on Steiner Tree and Related Problems. | Jesper Nederlof |