All Stories

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

    Article • ACM Transactions on Algorithms, January 2026, ACM (Association for Computing Machinery)

    Karol Wegrzycki, Jesper Nederlof

  2. In this paper, we consider approximation algorithms for Euclidean TSP problem.

    Article • Journal of the ACM, November 2025, ACM (Association for Computing Machinery)

    Karol Wegrzycki, Jesper Nederlof

  3. Competitive Algorithms for Generalized k -Server in Uniform Metrics

    Article • ACM Transactions on Algorithms, December 2022, ACM (Association for Computing Machinery)

    Jesper Nederlof

  4. Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time

    Article • ACM Transactions on Algorithms, October 2022, ACM (Association for Computing Machinery)

    Jesper Nederlof

  5. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

    Article • ACM Transactions on Algorithms, April 2022, ACM (Association for Computing Machinery)

    Jesper Nederlof

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

    Article • June 2021, ACM (Association for Computing Machinery)

    Jesper Nederlof