No. Title Author Year
1 New Bounds for Randomized List Update in the Paid Exchange Model Albers, Susanne et al. 2020
2 Improved Online Algorithms for Knapsack and GAP in the Random Order Model Albers, Susanne et al. 2019
3 New Results for the k-Secretary Problem Albers, Susanne et al. 2019
4 On the Value of Penalties in Time-Inconsistent Planning Albers, Susanne et al. 2017
5 Tight Bounds for Online Coloring of Basic Graph Classes Albers, Susanne et al. 2017
6 Modeling Real-World Data Sets (Invited Talk) Albers, Susanne 2015
7 LIPIcs, Volume 1, STACS'08, Complete Volume Albers, Susanne et al. 2013
8 LIPIcs, Volume 3, STACS'09, Complete Volume Albers, Susanne et al. 2013
9 Scheduling (Dagstuhl Seminar 13111) Albers, Susanne et al. 2013
10 Algorithms for Dynamic Speed Scaling Albers, Susanne 2011
11 Energy-Efficient Algorithms (Invited Talk) Albers, Susanne 2011
12 10071 Abstracts Collection -- Scheduling Albers, Susanne et al. 2010
13 10071 Executive Summary -- Scheduling Albers, Susanne et al. 2010
14 Preface -- 26th International Symposium on Theoretical Aspects of Computer Science Albers, Susanne et al. 2009
15 Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science Albers, Susanne et al. 2008
16 Preface -- 25th International Symposium on Theoretical Aspects of Computer Science Albers, Susanne et al. 2008
17 04091 Abstracts Collection -- Data Structures Albers, Susanne et al. 2005
18 05031 Abstracts Collection -- Algorithms for Optimization with Incomplete Information Albers, Susanne et al. 2005
19 05031 Summary -- Algorithms for Optimization with Incomplete Information Albers, Susanne et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 19


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