1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2017★ 1 cited
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…
cs.CC2017
When can Graph Hyperbolicity be computed in Linear Time?
Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen int…