1 citations · 1 across the 2 of their papers we have counts for
6 papers
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…
Complete Edge-Colored Permutation Graphs
Tom Hartmann, Max Bannach, Martin Middendorf +3
We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph $G=…
Positive-Instance Driven Dynamic Programming for Graph Searching
Max Bannach, Sebastian Berndt
Research on the similarity of a graph to being a tree - called the treewidth of the graph - has seen an enormous rise within the last decade, but a practically fast algorithm for t…
Towards Work-Efficient Parallel Parameterized Algorithms
Max Bannach, Malte Skambath, Till Tantau
Parallel parameterized complexity theory studies how fixed-parameter tractable (fpt) problems can be solved in parallel. Previous theoretical work focused on parallel algorithms th…
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 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…