| No. |
Title |
Author |
Year |
| 1 |
An Approximation Algorithm for the Matrix Tree Multiplication Problem |
Abo-Khamis, Mahmoud et al. |
2021 |
| 2 |
An Efficient Reduction of a Gammoid to a Partition Matroid |
Leichter, Marilena et al. |
2021 |
| 3 |
Relational Algorithms for k-Means Clustering |
Moseley, Benjamin et al. |
2021 |
| 4 |
Matroid Coflow Scheduling |
Im, Sungjin et al. |
2019 |
| 5 |
Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers |
Pruhs, Kirk et al. |
2017 |
| 6 |
LIPIcs, Volume 87, ESA'17, Complete Volume |
Pruhs, Kirk et al. |
2017 |
| 7 |
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing |
Im, Sungjin et al. |
2017 |
| 8 |
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs |
Bansal, Nikhil et al. |
2015 |
| 9 |
Stochastic Scheduling of Heavy-tailed Jobs |
Im, Sungjin et al. |
2015 |
| 10 |
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules |
Antoniadis, Antonios et al. |
2014 |
| 11 |
Scheduling (Dagstuhl Seminar 13111) |
Albers, Susanne et al. |
2013 |
| 12 |
10071 Abstracts Collection -- Scheduling |
Albers, Susanne et al. |
2010 |
| 13 |
10071 Executive Summary -- Scheduling |
Albers, Susanne et al. |
2010 |
| 14 |
An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints |
Abousamra, Ahmed et al. |
2010 |
| 15 |
Scalably Scheduling Processes with Arbitrary Speedup Curves |
Edmonds, Jeff et al. |
2010 |
| 16 |
Nonclairvoyant Speed Scaling for Flow and Energy |
Chan, Ho-Leung et al. |
2009 |
| 17 |
08071 Abstracts Collection -- Scheduling |
Liu, Jane W. S. et al. |
2008 |
| 18 |
08071 Executive Summary -- Scheduling |
Liu, Jane W. S. et al. |
2008 |
| 19 |
07261 Abstracts Collection -- Fair Division |
Brams, Steven J. et al. |
2007 |
| 20 |
07261 Summary -- Fair Division |
Brams, Steven J. et al. |
2007 |
