We initiate the theoretical study a fundamental algorithmic problem: How to schedule the rerouting of k unsplittable network flows (of a certain demand) from their current paths to their respectiveâ€¦ (More)

In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these games on undirected graphs characterises tree width by the least number of cops needed to win. Weâ€¦ (More)

The software-defined networking paradigm introduces interesting opportunities to operate networks in a more flexible yet formally verifiable manner. Despite the logically centralized control,â€¦ (More)

A classical result by ErdÅ‘s and PÃ³sa[3] states that there is a function f : N â†’ N such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) verticesâ€¦ (More)

The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimumâ€¦ (More)

We provide a new constant factor approximation algorithm for the (connected) distance-r dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include manyâ€¦ (More)

Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining theâ€¦ (More)

We study the version of the k-disjoint paths problem where k demand pairs (s1, t1), . . . , (sk, tk) are specified in the input and the paths in the solution are allowed to intersect, but such thatâ€¦ (More)

This paper shows that the results by Czygrinow et al. (DISC 2008) and Amiri et al. (PODC 2016) can be combined to obtain a O(logâˆ— n)-time local and deterministic approximation scheme for Minimumâ€¦ (More)

The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k whenâ€¦ (More)