1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…