| Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities | 0 | 0.34 | 2022 |
| Algorithms for Energy Conservation in Heterogeneous Data Centers. | 0 | 0.34 | 2021 |
| Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. | 0 | 0.34 | 2021 |
| Machine Covering in the Random-Order Model. | 0 | 0.34 | 2021 |
| EATCS Distinguished Dissertation Award 2020 - Call for Nominations. | 0 | 0.34 | 2020 |
| Explorable Uncertainty in Scheduling with Non-Uniform Testing Times | 0 | 0.34 | 2020 |
| New Results for the k-Secretary Problem. | 0 | 0.34 | 2019 |
| EATCS Distinguished Dissertation Award 2018 - Call for Nominations. | 0 | 0.34 | 2018 |
| Recent Results for Online Makespan Minimization. | 0 | 0.34 | 2013 |
| Energy-Efficient Algorithms (Invited Talk). | 0 | 0.34 | 2011 |
| 10071 Abstracts Collection - Scheduling. | 0 | 0.34 | 2010 |
| 10071 Executive Summary - Scheduling. | 0 | 0.34 | 2010 |
| STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings | 44 | 5.20 | 2008 |
| Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science | 0 | 0.34 | 2008 |
| Data Structures, 22.-27. February 2004 | 1 | 0.63 | 2005 |
| Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings | 66 | 4.74 | 2004 |
| 04091 Abstracts Collection - Data Structures | 0 | 0.34 | 2004 |
| Some Algorithmic Problems in Large Networks | 0 | 0.34 | 2001 |
| Improved parallel integer sorting without concurrent writing | 0 | 0.34 | 1992 |
