Jesper Nederlof

Orcid: 0000-0003-1848-0076

Affiliations:
  • Utrecht University, The Netherlands


According to our database1, Jesper Nederlof authored at least 70 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs.
J. Comput. Syst. Sci., 2025

2024
Parameterized problems complete for nondeterministic FPT time and logarithmic space.
Inf. Comput., 2024

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K<sub>4</sub>-Minor.
CoRR, 2024

Parameterized Algorithms for Covering by Arithmetic Progressions.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Exact and Parameterized Algorithms for Choosability.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
SIAM J. Comput., December, 2023

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.
SIAM J. Discret. Math., September, 2023

Competitive Algorithms for Generalized <i>k</i>-Server in Uniform Metrics.
ACM Trans. Algorithms, January, 2023

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

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

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models.
Electron. J. Comb., 2023

Tight Lower Bounds for Problems Parameterized by Rank-Width.
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.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i><sup>⋆</sup> (2.7<i>k</i>) Time.
ACM Trans. Algorithms, 2022

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.
ACM Trans. Algorithms, 2022

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995<sup>n</sup>) time.
CoRR, 2022

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

Isolation Schemes for Problems on Decomposable Graphs.
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.
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.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.
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.
ACM Trans. Algorithms, 2020

Detecting and counting small patterns in planar graphs in subexponential parameterized time.
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.
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<sup><i>k</i></sup>) Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019
Computing the chromatic number using graph decompositions via matrix rank.
Theor. Comput. Sci., 2019

Parameterized Complexity of Partial Scheduling.
CoRR, 2019

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

New Tools and Connections for Exponential-Time Approximation.
Algorithmica, 2019

Hamiltonicity Below Dirac's Condition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Equal-Subset-Sum Faster Than the Meet-in-the-Middle.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.
IEEE Trans. Inf. Theory, 2018

Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems.
SIAM J. Comput., 2018

Fast Hamiltonicity Checking Via Bases of Perfect Matchings.
J. ACM, 2018

On Directed Feedback Vertex Set Parameterized by Treewidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

More consequences of falsifying SETH and the orthogonal vectors conjecture.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
A short note on Merlin-Arthur protocols for subset sum.
Inf. Process. Lett., 2017

Competitive Algorithms for Generalized k-Server in Uniform Metrics.
CoRR, 2017

Faster space-efficient algorithms for subset sum and k-sum.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Exact Algorithms and Time/Space Tradeoffs.
Encyclopedia of Algorithms, 2016

On Problems as Hard as CNF-SAT.
ACM Trans. Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.
ACM Trans. Algorithms, 2016

Dense Subset Sum May Be the Hardest.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Subexponential Time Algorithms for Embedding H-Minor Free Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Finding Large Set Covers Faster via the Representation Method.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Exponential Time Paradigms Through the Polynomial Time Lens.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Minimizing Rosenthal Potential in Multicast Games.
Theory Comput. Syst., 2015

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth.
Inf. Comput., 2015

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

Subset Sum in the Absence of Concentration.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Subexponential Time Algorithms for Finding Small Tree and Path Decompositions.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Inclusion/Exclusion Meets Measure and Conquer.
Algorithmica, 2014

2013
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion.
Algorithmica, 2013

2012
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
SIAM J. Discret. Math., 2012

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

Reducing a Target Interval to a Few Exact Queries.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Homomorphic Hashing for Sparse Coefficient Extraction.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011
On Problems as Hard as CNFSAT
CoRR, 2011

2010
Generalized Graph Clustering: Recognizing (<i>p</i>, <i>q</i>)-Cluster Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Saving space by algebraization.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.
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.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009


  Loading...