1 citations · 1 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018
Computing Kernels in Parallel: Lower and Upper Bounds
Max Bannach, Till Tantau
Parallel fixed-parameter tractability studies how parameterized problems can be solved in parallel. A surprisingly large number of parameterized problems admit a high level of para…
cs.DS2018
Practical Access to Dynamic Programming on Tree Decompositions
Max Bannach, Sebastian Berndt
Parameterized complexity theory has lead to a wide range of algorithmic breakthroughs within the last decades, but the practicability of these methods for real-world problems is st…
cs.CC2018
Computing Hitting Set Kernels By AC^0-Circuits
Max Bannach, Till Tantau
Given a hypergraph , what is the smallest subset such that holds for all ? This problem, known as the hitting set prob…