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
∙
12/12/2021
Temporal Unit Interval Independent Sets
Temporal graphs have been recently introduced to model changes to a give...
research
∙
10/07/2021
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
A polynomial Turing kernel for some parameterized problem P is a polynom...
research
∙
10/09/2020
Equitable Scheduling on a Single Machine
We introduce a natural but seemingly yet unstudied generalization of the...
research
∙
07/02/2020
Approximating Sparse Quadratic Programs
Given a matrix A ∈ℝ^n× n, we consider the problem of maximizing x^TAx su...
research
∙
05/31/2020
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
We present a data structure that in a dynamic graph of treedepth at most...
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
∙
02/18/2020
Computing the k Densest Subgraphs of a Graph
Computing cohesive subgraphs is a central problem in graph theory. While...
research
∙
11/27/2019
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs
The 1|B,r_j|∑ w_jU_j scheduling problem takes as input a batch setup tim...
research
∙
07/24/2018
A Note on Clustering Aggregation
We consider the clustering aggregation problem in which we are given a s...
research
∙
07/17/2018
On Computing Centroids According to the p-Norms of Hamming Distance Vectors
In this paper we consider the p-Norm Hamming Centroid problem which asks...
research
∙
02/22/2018
The Clever Shopper Problem
We investigate a variant of the so-called "Internet Shopping Problem" in...
research
∙
09/18/2017
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
In this paper we study the classical single machine scheduling problem w...
research
∙
07/13/2017
