| No. |
Title |
Author |
Year |
| 1 |
MaxSAT with Absolute Value Functions: A Parameterized Perspective |
Bannach, Max et al. |
2022 |
| 2 |
On the Parallel Parameterized Complexity of MaxSAT Variants |
Bannach, Max et al. |
2022 |
| 3 |
Dynamic Kernels for Hitting Sets and Set Packing |
Bannach, Max et al. |
2021 |
| 4 |
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time |
Bannach, Max et al. |
2020 |
| 5 |
PACE Solver Description: Fluid |
Bannach, Max et al. |
2020 |
| 6 |
PACE Solver Description: PID^⋆ |
Bannach, Max et al. |
2020 |
| 7 |
Solving Packing Problems with Few Small Items Using Rainbow Matchings |
Bannach, Max et al. |
2020 |
| 8 |
Computing Kernels in Parallel: Lower and Upper Bounds |
Bannach, Max et al. |
2019 |
| 9 |
On the Descriptive Complexity of Color Coding |
Bannach, Max et al. |
2019 |
| 10 |
Computing Hitting Set Kernels By AC^0-Circuits |
Bannach, Max et al. |
2018 |
| 11 |
Practical Access to Dynamic Programming on Tree Decompositions |
Bannach, Max et al. |
2018 |
| 12 |
Jdrasil: A Modular Library for Computing Tree Decompositions |
Bannach, Max et al. |
2017 |
| 13 |
Parallel Multivariate Meta-Theorems |
Bannach, Max et al. |
2017 |
| 14 |
Fast Parallel Fixed-parameter Algorithms via Color Coding |
Bannach, Max et al. |
2015 |
