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

1 |
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars |
Bringmann, Karl et al. |
2017 |

2 |
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs |
Bringmann, Karl et al. |
2017 |

3 |
Maximum Volume Subset Selection for Anchored Boxes |
Bringmann, Karl et al. |
2017 |

4 |
On Algebraic Branching Programs of Small Width |
Bringmann, Karl et al. |
2017 |

5 |
Sampling Geometric Inhomogeneous Random Graphs in Linear Time |
Bringmann, Karl et al. |
2017 |

6 |
Hitting Set for Hypergraphs of Low VC-dimension |
Bringmann, Karl et al. |
2016 |

7 |
Approximability of the Discrete Fréchet Distance |
Bringmann, Karl et al. |
2015 |

8 |
Parameterized Complexity Dichotomy for Steiner Multicut |
Bringmann, Karl et al. |
2015 |

9 |
Balls into bins via local search: cover time and maximum load |
Bringmann, Karl et al. |
2014 |