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

1 |
Connected k-Center and k-Diameter Clustering |
Drexler, Lukas et al. |
2023 |

2 |
Minimum-Error Triangulations for Sea Surface Reconstruction |
Arutyunova, Anna et al. |
2022 |

3 |
The Price of Hierarchical Clustering |
Arutyunova, Anna et al. |
2022 |

4 |
Bicriteria Aggregation of Polygons via Graph Cuts |
Rottmann, Peter et al. |
2021 |

5 |
Upper and Lower Bounds for Complete Linkage in General Metric Spaces |
Arutyunova, Anna et al. |
2021 |

6 |
Noisy, Greedy and Not so Greedy k-Means++ |
Bhattacharya, Anup et al. |
2020 |

7 |
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) |
Manthey, Bodo et al. |
2017 |

8 |
The Alternating Stock Size Problem and the Gasoline Puzzle |
Newman, Alantha et al. |
2016 |

9 |
Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372) |
Balcan, Marina-Florina et al. |
2015 |

10 |
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm |
Brunsch, Tobias et al. |
2015 |

11 |
Economical Caching |
Englert, Matthias et al. |
2009 |