| No. |
Title |
Author |
Year |
| 1 |
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions |
Bulteau, Laurent et al. |
2022 |
| 2 |
On the Parallel Parameterized Complexity of MaxSAT Variants |
Bannach, Max et al. |
2022 |
| 3 |
On the Satisfaction Probability of k-CNF Formulas |
Tantau, Till |
2022 |
| 4 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121) |
Gál, Anna et al. |
2021 |
| 5 |
Dynamic Kernels for Hitting Sets and Set Packing |
Bannach, Max et al. |
2021 |
| 6 |
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time |
Bannach, Max et al. |
2020 |
| 7 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121) |
Gál, Anna et al. |
2019 |
| 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 |
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) |
Tantau, Till |
2017 |
| 12 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) |
Gál, Anna et al. |
2017 |
| 13 |
Parallel Multivariate Meta-Theorems |
Bannach, Max et al. |
2017 |
| 14 |
Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification |
Tantau, Till |
2015 |
| 15 |
Fast Parallel Fixed-parameter Algorithms via Color Coding |
Bannach, Max et al. |
2015 |
| 16 |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth |
Elberfeld, Michael et al. |
2012 |
| 17 |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise |
Manthey, Bodo et al. |
2007 |
| 18 |
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space |
Jakoby, Andreas et al. |
2006 |
