No. |
Title |
Author |
Year |
---|

1 |
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time |
Bannach, Max et al. |
2020 |

2 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121) |
Gál, Anna et al. |
2019 |

3 |
Computing Kernels in Parallel: Lower and Upper Bounds |
Bannach, Max et al. |
2019 |

4 |
On the Descriptive Complexity of Color Coding |
Bannach, Max et al. |
2019 |

5 |
Computing Hitting Set Kernels By AC^0-Circuits |
Bannach, Max et al. |
2018 |

6 |
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) |
Tantau, Till |
2017 |

7 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) |
Gál, Anna et al. |
2017 |

8 |
Parallel Multivariate Meta-Theorems |
Bannach, Max et al. |
2017 |

9 |
Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification |
Tantau, Till |
2015 |

10 |
Fast Parallel Fixed-parameter Algorithms via Color Coding |
Bannach, Max et al. |
2015 |

11 |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth |
Elberfeld, Michael et al. |
2012 |

12 |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise |
Manthey, Bodo et al. |
2007 |

13 |
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space |
Jakoby, Andreas et al. |
2006 |