4 papers · 1 filter
Parameterized Complexity of Temporal Agony
Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann +1
Real-world networks are often organized in several layers forming a hierarchy which determines the interaction between the individual components. In order to discover such hierarch…
Efficient parameterized approximation
Stefan Kratsch, Pascal Kunz
Many problems are NP-hard and, unless P = NP, do not admit polynomial-time exact algorithms. The fastest known exact algorithms exactly usually take time exponential in the input s…
Approximate Turing kernelization and lower bounds for domination problems
Stefan Kratsch, Pascal Kunz
An -approximate polynomial Turing kernelization is a polynomial-time algorithm that computes an -approximate solution for a parameterized optimization problem when given a…
Disentangling the Computational Complexity of Network Untangling
Vincent Froese, Pascal Kunz, Philipp Zschoche
We study the network untangling problem introduced by Rozenshtein, Tatti, and Gionis [DMKD 2021], which is a variant of Vertex Cover on temporal graphs -- graphs whose edge set cha…