The following pages link to Max Bannach (Q1987508):
Displaying 18 items.
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Positive-instance driven dynamic programming for graph searching (Q2285082) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- Jdrasil: A Modular Library for Computing Tree Decompositions (Q4580187) (← links)
- Parallel Multivariate Meta-Theorems (Q4634387) (← links)
- (Q5009475) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- (Q5089171) (← links)
- On the Descriptive Complexity of Color Coding (Q5090457) (← links)
- Towards Work-Efficient Parallel Parameterized Algorithms (Q5236174) (← links)
- (Q5363777) (← links)
- (Q6059165) (← links)
- (Q6089675) (← links)
- (Q6089676) (← links)
- (Q6192475) (← links)
