Jesper Nederlof

According to our database, Jesper Nederlof authored at least 67 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs.

Jesper Nederlof, Krisztina Szilágyi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Parameterized Algorithms for Covering by Arithmetic Progressions.

Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Exact and Parameterized Algorithms for Choosability.

Ivan Bliznets, Jesper Nederlof

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.

Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki

SIAM J. Comput., December, 2023

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki

SIAM J. Discret. Math., September, 2023

Competitive Algorithms for Generalized <i>k</i>-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

ACM Trans. Algorithms, January, 2023

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters.

Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski

CoRR, 2023

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.

Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki

CoRR, 2023

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.

Andreas Björklund, Petteri Kaski, Jesper Nederlof

CoRR, 2023

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models.

Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki

Electron. J. Comb., 2023

Tight Lower Bounds for Problems Parameterized by Rank-Width.

Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth.

Isja Mannens, Jesper Nederlof

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.

Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i>^⋆ (2.7<i>k</i>) Time.

Jason Li, Jesper Nederlof

ACM Trans. Algorithms, 2022

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

ACM Trans. Algorithms, 2022

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995ⁿ) time.

Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki

CoRR, 2022

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.

Jesper Nederlof, Céline M. F. Swennenhuis

Algorithmica, 2022

Isolation Schemes for Problems on Decomposable Graphs.

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.

Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.

Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors.

Jesper Nederlof, Karol Wegrzycki

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.

Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.

Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces.

Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen

ACM Trans. Algorithms, 2020

Detecting and counting small patterns in planar graphs in subexponential parameterized time.

Jesper Nederlof

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication.

Jesper Nederlof

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i>*(2.7^<i>k</i>) Time.

Jason Li, Jesper Nederlof

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices.

Jesper Nederlof

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Computing the chromatic number using graph decompositions via matrix rank.

Bart M. P. Jansen, Jesper Nederlof

Theor. Comput. Sci., 2019

Parameterized Complexity of Partial Scheduling.

Jesper Nederlof, Céline M. F. Swennenhuis

CoRR, 2019

Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time.

Jason Li, Jesper Nederlof

CoRR, 2019

New Tools and Connections for Exponential-Time Approximation.

Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof

Algorithmica, 2019

Hamiltonicity Below Dirac's Condition.

Bart M. P. Jansen, László Kozma, Jesper Nederlof

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Equal-Subset-Sum Faster Than the Meet-in-the-Middle.

Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

IEEE Trans. Inf. Theory, 2018

Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems.

Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas

SIAM J. Comput., 2018

Fast Hamiltonicity Checking Via Bases of Perfect Matchings.

Marek Cygan, Stefan Kratsch, Jesper Nederlof

J. ACM, 2018

On Directed Feedback Vertex Set Parameterized by Treewidth.

Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

More consequences of falsifying SETH and the orthogonal vectors conjecture.

Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.

Radu Curticapean, Nathan Lindzey, Jesper Nederlof

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

A short note on Merlin-Arthur protocols for subset sum.

Jesper Nederlof

Inf. Process. Lett., 2017

Competitive Algorithms for Generalized k-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

CoRR, 2017

Faster space-efficient algorithms for subset sum and k-sum.

Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Exact Algorithms and Time/Space Tradeoffs.

Jesper Nederlof

Encyclopedia of Algorithms, 2016

On Problems as Hard as CNF-SAT.

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström

ACM Trans. Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen

ACM Trans. Algorithms, 2016

Dense Subset Sum May Be the Hardest.

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Subexponential Time Algorithms for Embedding H-Minor Free Graphs.

Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Finding Large Set Covers Faster via the Representation Method.

Jesper Nederlof

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Exponential Time Paradigms Through the Polynomial Time Lens.

Andrew Drucker, Jesper Nederlof, Rahul Santhanam

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Minimizing Rosenthal Potential in Multicast Games.

Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk

Theory Comput. Syst., 2015

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth.

Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof

Inf. Comput., 2015

Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.

Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof

Algorithmica, 2015

Subset Sum in the Absence of Concentration.

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Subexponential Time Algorithms for Finding Small Tree and Path Decompositions.

Hans L. Bodlaender, Jesper Nederlof

Proceedings of the Algorithms - ESA 2015, 2015

2014

Inclusion/Exclusion Meets Measure and Conquer.

Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk

Algorithmica, 2014

2013

Fast Polynomial-Space Algorithms Using Inclusion-Exclusion.

Jesper Nederlof

Algorithmica, 2013

2012

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof

SIAM J. Discret. Math., 2012

Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time

Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof

CoRR, 2012

Reducing a Target Interval to a Few Exact Queries.

Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Homomorphic Hashing for Sparse Coefficient Extraction.

Petteri Kaski, Mikko Koivisto, Jesper Nederlof

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

On Problems as Hard as CNFSAT

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström

CoRR, 2011

2010

Generalized Graph Clustering: Recognizing (<i>p</i>, <i>q</i>)-Cluster Graphs.

Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Saving space by algebraization.

Daniel Lokshtanov, Jesper Nederlof

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting.

Jesper Nederlof, Johan M. M. van Rooij

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.

Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems.

Jesper Nederlof

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009