All Stories

  1. Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling

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

    Karol Wegrzycki

  2. Beating Meet-in-the-Middle for Subset Balancing Problems

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

    Karol Wegrzycki

  3. 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

  4. 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

  5. A conditionally optimal algorithm for deciding whether basic parallel systems are safe

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

    Henry Sinclair-Banks, Karol Wegrzycki