We study the general integer programming problem where the number of variables $ n $ is a
variable part of the input. We consider two natural parameters of the constraint matrix $ A …

The theory of $ n $-fold integer programming has been recently emerging as an important
tool in parameterized complexity. The input to an $ n $-fold integer program (IP) consists of …

Scheduling problems are fundamental in combinatorial optimization. Much work has been
done on approximation algorithms for NP-hard cases, but relatively little is known about …

Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …

We study the parameterized complexity of counting variants of Swap-and Shift-Bribery,
focusing on the parameterizations by the number of swaps and the number of voters. Facing …

We consider integer programming problems $\max\{c^ T x:\mathcal {A} x= b, l\leq x\leq u,
x\in\mathbb {Z}^{nt}\} $ where $\mathcal {A} $ has a (recursive) block-structure generalizing" …

We study the effects of campaigning, where the society is partitioned into voter clusters and
a diffusion process propagates opinions in a network connecting the clusters. Our model can …

We consider integer and linear programming problems for which the linear constraints
exhibit a (recursive) block-structure: The problem decomposes into independent and …

We consider the standard ILP Feasibility problem: given an integer linear program of the
form {A x= b, x⩾ 0}, where A is an integer matrix with k rows and ℓ columns, x is a vector of ℓ …

We study the robustness of approval-based participatory budgeting (PB) rules to random
noise in the votes. First, we analyze the computational complexity of the# Flip-Bribery …