We introduce a new framework for the analysis of preprocessing routines ...
The streaming model was introduced to parameterized complexity independe...
Patience Sort sorts a sequence of numbers with a minimal number of queue...
Subexponential parameterized algorithms are known for a wide range of na...
In the Disjoint Paths problem, the input is an undirected graph G on n
v...
We study the problem of fairly allocating a set of indivisible goods amo...
The study of fault-tolerant data structures for various network design
p...
Let G be a directed graph with n vertices and m edges, and let s ∈
V(G) ...
A tournament is a directed graph T such that every pair of vertices
is ...
An input to the Popular Matching problem, in the roommates setting, cons...