1 citations · 1 across the 1 of their papers we have counts for
5 papers
On the Parallel Parameterized Complexity of MaxSAT Variants
Max Bannach, Malte Skambath, Till Tantau
In the maximum satisfiability problem (MAX-SAT) we are given a propositional formula in conjunctive normal form and have to find an assignment that satisfies as many clauses as pos…
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…
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…
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…
Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
Malte Skambath, Till Tantau
While the algorithmic drawing of static trees is well-understood and well-supported by software tools, creating animations depicting how a tree changes over time is currently diffi…