No. Title Author Year
1 Bicriteria Aggregation of Polygons via Graph Cuts Rottmann, Peter et al. 2021
2 Upper and Lower Bounds for Complete Linkage in General Metric Spaces Arutyunova, Anna et al. 2021
3 Noisy, Greedy and Not so Greedy k-Means++ Bhattacharya, Anup et al. 2020
4 Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) Manthey, Bodo et al. 2017
5 The Alternating Stock Size Problem and the Gasoline Puzzle Newman, Alantha et al. 2016
6 Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372) Balcan, Marina-Florina et al. 2015
7 Solving Totally Unimodular LPs with the Shadow Vertex Algorithm Brunsch, Tobias et al. 2015
8 Economical Caching Englert, Matthias et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI