Node connectivity plays a central role in temporal network analysis. We provide a broad
study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets …

Abstract The NP-complete Vertex Cover problem asks to cover all edges of a graph by a
small (given) number of vertices. It is among the most prominent graph-algorithmic …

Node connectivity plays a central role in temporal network analysis. We provide a
comprehensive study of various concepts of walks in temporal graphs, that is, graphs with …

Time-evolving or temporal graphs gain more and more popularity when exploring complex
networks. In this context, the multistage view on computational problems is among the most …

Electing a single committee of a small size is a classical and well-understood voting
situation. Being interested in a sequence of committees, we introduce and study two time …

We study q-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein,
given a sequence of q-CNF formulas and a non-negative integer d, the question is whether …

Within many real-world networks, the links between pairs of nodes change over time. Thus,
there has been a recent boom in studying temporal graphs. Recognizing patterns in …

We study $ q $-SAT in the multistage model, focusing on the linear-time solvable 2-SAT.
Herein, given a sequence of $ q $-CNF fomulas and a non-negative integer $ d $, the …

N a classical combinatorial optimization setting, given an instance of a problem one needs
to find a good feasible solution. However, in many situations, the data may evolve over time …

We study the parameterized complexity of multistage committee elections under Veto, Bloc,
Borda, Copeland, Chamberlin-Courant and Monroe rules, where we aim to elect a …