We study the following model of disease spread in a social network. At f...
Social distance games have been extensively studied as a coalition forma...
We propose a novel model for refugee housing respecting the preferences ...
In this paper, we give a very simple proof that Treewidth is NP-complete...
For many problems, the important instances from practice possess certain...
Given an undirected graph G=(V,E), vertices s,t∈ V, and an integer k,
Tr...
Hedonic diversity games are a variant of the classical Hedonic games des...
Fairly dividing a set of indivisible resources to a set of agents is of
...
Consider a vertex-weighted graph G with a source s and a target t.
Track...
Inspired by the famous Target Set Selection problem, we propose a new
di...
Given a set of agents qualifying or disqualifying each other, group
iden...
We study a variant of Set Cover where each element of the universe has s...
Recently a strong connection has been shown between the tractability of
...
We investigate the parameterized complexity of the recognition problem f...
Since the early days of research in algorithms and complexity, the
compu...
Using insights from parametric integer linear programming, we significan...
Makespan minimization (on parallel identical or unrelated machines) is
a...
In the Steiner Tree problem we are given an edge weighted undirected gra...
We continue and extend previous work on the parameterized complexity ana...
In the presented paper we study the Length-Bounded Cut problem for speci...
Configuration integer programs (IP) have been key in the design of algor...
Adaptivity to changing environments and constraints is key to success in...
We introduce a general problem about bribery in voting systems. In the
R...
We consider the ILP Feasibility problem: given an integer linear program...
A prototypical graph problem is centered around a graph theoretic proper...
Vertex deletion problems are those where given a graph G and a graph pro...
In recent years, algorithmic breakthroughs in stringology, computational...
In the Directed Steiner Network problem we are given an arc-weighted dig...
Manipulation models for electoral systems are a core research theme in s...
In the past 30 years, results regarding special classes of integer linea...
We study the Steiner Tree problem, in which a set of terminal vertices n...