43 citations · 89 across the 32 of their papers we have counts for
8 papers · 1 filter
Fair Knapsack
Till Fluschnik, Piotr Skowron, Mervin Triphaus +1
We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and eac…
The Complexity of Finding Small Separators in Temporal Graphs
Philipp Zschoche, Till Fluschnik, Hendrik Molter +1
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex set (the separator) with respect to two designated terminal vertices such that th…
Exact Mean Computation in Dynamic Time Warping Spaces
Markus Brill, Till Fluschnik, Vincent Froese +3
Dynamic time warping constitutes a major tool for analyzing time series. In particular, computing a mean series of a given sample of series in dynamic time warping spaces (by minim…
Kernelization Lower Bounds for Finding Constant-Size Subgraphs
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instan…
The Complexity of Routing with Few Collisions
Till Fluschnik, Marco Morik, Manuel Sorge
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph with two distinct terminal verti…
The Minimum Shared Edges Problem on Grid-like Graphs
Till Fluschnik, Meike Hatzel, Steffen Härtlein +2
We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route paths from a start vertex to a target vertex in a given graph while us…