We study pseudo-polynomial time algorithms for the fundamental 0-1 Knapsack problem.
Recent research interest has focused on its fine-grained complexity with respect to the …

Computing the convolution A∗ B of two length-n integer vectors A, B is a core problem in
several disciplines. It frequently comes up as a subroutine in various problem domains, eg in …

The starting point of this paper is the problem of scheduling n jobs with processing times and
due dates on a single machine so as to minimize the total processing time of tardy jobs, ie …

We consider the $1||\sum w_J U_j $ problem, the problem of minimizing the weighted
number of tardy jobs on a single machine. This problem is one of the most basic and …

In this paper we consider the fundamental scheduling problem of minimizing the weighted
number of tardy jobs on a single machine. We present a simple pseudo polynomial-time …

In this work we revisit the elementary scheduling problem $1||\sum p_j U_j $. The goal is to
select, among $ n $ jobs with processing times and due dates, a subset of jobs with …

We consider the problem of minimizing the total processing time of tardy jobs on a single
machine. This is a classical scheduling problem, first considered by [Lawler and Moore …

We investigate the question whether Subset Sum can be solved by a polynomial-time
algorithm with access to a certificate of length poly (k) where k is the maximal number of bits …

We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j $: schedule a set
of $ n $ jobs with weights, processing times, release dates, and due dates on a single …

In this PhD thesis on fine-grained algorithm design and complexity, we investigate output-
sensitive and sublinear-time algorithms for two important problems.(1) Sparse Convolution …