| No. |
Title |
Author |
Year |
| 1 |
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty |
Bampis, Evripidis et al. |
2021 |
| 2 |
Online Computation with Untrusted Advice |
Angelopoulos, Spyros et al. |
2020 |
| 3 |
Best-Of-Two-Worlds Analysis of Online Search |
Angelopoulos, Spyros et al. |
2019 |
| 4 |
Online Maximum Matching with Recourse |
Angelopoulos, Spyros et al. |
2018 |
| 5 |
Scheduling with Explorable Uncertainty |
Dürr, Christoph et al. |
2018 |
| 6 |
On the Power of Advice and Randomization for Online Bipartite Matching |
Dürr, Christoph et al. |
2016 |
| 7 |
Online Algorithms for Multi-Level Aggregation |
Bienkowski, Marcin et al. |
2016 |
| 8 |
The Expanding Search Ratio of a Graph |
Angelopoulos, Spyros et al. |
2016 |
| 9 |
LIPIcs, Volume 14, STACS'12, Complete Volume |
Dürr, Christoph et al. |
2013 |
| 10 |
LIPIcs, Volume 9, STACS'11, Complete Volume |
Schwentick, Thomas et al. |
2013 |
| 11 |
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents |
Dürr, Christoph et al. |
2012 |
| 12 |
Frontmatter, Table of Contents, Preface, Conference Organization |
Schwentick, Thomas et al. |
2011 |
| 13 |
Index of Authors |
Schwentick, Thomas et al. |
2011 |
| 14 |
Polynomial Time Algorithms for Minimum Energy Scheduling |
Chrobak, Marek et al. |
2010 |
