research
∙
08/24/2023
No Polynomial Kernels for Knapsack
This paper focuses on kernelization algorithms for the fundamental Knaps...
share
research
∙
06/26/2022
Hardness of Interval Scheduling on Unrelated Machines
We provide new (parameterized) computational hardness results for Interv...
research
∙
02/14/2022
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights
In this paper we prove new results concerning pseudo-polynomial time alg...
research
∙
12/27/2021
Equitable Scheduling for the Total Completion Time Objective
We investigate a novel scheduling problem where we have n clients, each ...
research
∙
10/09/2020
Equitable Scheduling on a Single Machine
We introduce a natural but seemingly yet unstudied generalization of the...
research
∙
03/16/2020
Scheduling Lower Bounds via AND Subset Sum
Given N instances (X_1,t_1),...,(X_N,t_N) of Subset Sum, the AND Subset ...
research
∙
03/16/2020
Faster Minimization of Tardy Processing Time on a Single Machine
This paper is concerned with the 1||∑ p_jU_j problem, the problem of min...
research
∙
09/18/2017
