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

1 |
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4 |
Gorbachev, Egor et al. |
2023 |

2 |
Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality |
Künnemann, Marvin et al. |
2023 |

3 |
A Structural Investigation of the Approximability of Polynomial-Time Problems |
Bringmann, Karl et al. |
2022 |

4 |
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves |
Bringmann, Karl et al. |
2022 |

5 |
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs |
Bringmann, Karl et al. |
2022 |

6 |
Fine-Grained Completeness for Optimization in P |
Bringmann, Karl et al. |
2021 |

7 |
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties |
An, Haozhe et al. |
2021 |

8 |
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction |
Künnemann, Marvin et al. |
2020 |

9 |
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation |
Bringmann, Karl et al. |
2020 |

10 |
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties |
Bringmann, Karl et al. |
2019 |

11 |
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance |
Bringmann, Karl et al. |
2019 |

12 |
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress |
Künnemann, Marvin |
2018 |

13 |
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence |
Duraj, Lech et al. |
2018 |

14 |
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming |
Künnemann, Marvin et al. |
2017 |

15 |
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem |
Doerr, Benjamin et al. |
2016 |