1 citations · 1 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
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…
cs.DS2019★ 1 cited
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…
cs.CC2019
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…