1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
MaxSAT with Absolute Value Functions: A Parameterized Perspective
Max Bannach, Pamela Fleischmann, Malte Skambath
The natural generalization of the Boolean satisfiability problem to optimization problems is the task of determining the maximum number of clauses that can simultaneously be satisf…
On the Descriptive Complexity of Color Coding
Max Bannach, Till Tantau
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first random…
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…
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…