| 2026 | SPAA | Minimizing Total Flow Time in the Online Active-Time Scheduling Model. | Susanne Albers, Gorsha Wessel van der Heijden |
| 2025 | LAGOS | On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms. | Susanne Albers, Waldo Glvez, mer Behic zdemir |
| 2025 | SOFSEM | Online b-Matching with Stochastic Rewards. | Susanne Albers, Sebastian Schubert |
| 2022 | ESA | Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. | Susanne Albers, Sebastian Schubert |
| 2021 | CIAC | Algorithms for Energy Conservation in Heterogeneous Data Centers. | Susanne Albers, Jens Quedenfeld |
| 2021 | ISAAC | Machine Covering in the Random-Order Model. | Susanne Albers, Waldo Glvez, Maximilian Janke |
| 2021 | SPAA | Algorithms for Right-Sizing Heterogeneous Data Centers. | Susanne Albers, Jens Quedenfeld |
| 2021 | WADS | Scheduling with Testing on Multiple Identical Parallel Machines. | Susanne Albers, Alexander Eckl |
| 2021 | WADS | Online Makespan Minimization with Budgeted Uncertainty. | Susanne Albers, Maximilian Janke |
| 2020 | ICALP | Scheduling in the Random-Order Model. | Susanne Albers, Maximilian Janke |
| 2020 | MFCS | Best Fit Bin Packing with Random Order Revisited. | Susanne Albers, Arindam Khan, Leon Ladewig |
| 2020 | STACS | New Bounds for Randomized List Update in the Paid Exchange Model. | Susanne Albers, Maximilian Janke |
| 2020 | WAOA | Explorable Uncertainty in Scheduling with Non-uniform Testing Times. | Susanne Albers, Alexander Eckl |
| 2019 | ISAAC | New Results for the k-Secretary Problem. | Susanne Albers, Leon Ladewig |
| 2018 | SPAA | Optimal Algorithms for Right-Sizing Data Centers. | Susanne Albers, Jens Quedenfeld |
| 2017 | ESA | Tight Bounds for Online Coloring of Basic Graph Classes. | Susanne Albers, Sebastian Schraink |
| 2017 | ICALP | On the Value of Penalties in Time-Inconsistent Planning. | Susanne Albers, Dennis Kraft |
| 2017 | SPAA | On Energy Conservation in Data Centers. | Susanne Albers |
| 2016 | LATIN | Scheduling on Power-Heterogeneous Processors. | Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz |
| 2015 | ICALP | Quantifying Competitiveness in Paging with Locality of Reference. | Susanne Albers, Dario Frascaria |
| 2013 | COCOON | Recent Results for Online Makespan Minimization. | Susanne Albers |
| 2013 | ICALP | Recent Advances for a Classical Scheduling Problem. | Susanne Albers |
| 2013 | ICALP | New Online Algorithms for Story Scheduling in Web Advertising. | Susanne Albers, Achim Passen |
| 2012 | ESA | On the Value of Job Migration in Online Makespan Minimization. | Susanne Albers, Matthias Hellwig |
| 2012 | SODA | Race to idle: new algorithms for speed scaling with a sleep state. | Susanne Albers, Antonios Antoniadis |
| 2011 | STACS | Algorithms for Dynamic Speed Scaling. | Susanne Albers |
| 2011 | SPAA | On multi-processor speed scaling with migration: extended abstract. | Susanne Albers, Antonios Antoniadis, Gero Greiner |
| 2010 | CSR | Algorithms for Energy Management. | Susanne Albers |
| 2009 | STACS | Preface - 26th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Jean-Yves Marion |
| 2008 | ICALP | On List Update with Locality of Reference. | Susanne Albers, Sonja Lauer |
| 2008 | SODA | On the value of coordination in network design. | Susanne Albers |
| 2008 | STACS | Preface - 25th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Pascal Weil |
| 2008 | STACS | Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Pascal Weil |
| 2007 | ESA | An Experimental Study of New and Known Online Packet Buffering Algorithms. | Susanne Albers, Tobias Jacobs |
| 2007 | SPAA | Speed scaling on parallel processors. | Susanne Albers, Fabian Mller, Swen Schmelzer |
| 2006 | SODA | On nash equilibria for a network creation game. | Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty |
| 2006 | STACS | Energy-Efficient Algorithms for Flow Time Minimization. | Susanne Albers, Hiroshi Fujiwara |
| 2004 | STOC | On the performance of greedy algorithms in packet buffering. | Susanne Albers, Markus Schmidt |
| 2004 | SPAA | New results on web caching with request reordering. | Susanne Albers |
| 2003 | ICALP | A Study of Integrated Document and Connection Caching. | Susanne Albers, Rob van Stee |
| 2003 | SODA | Dynamic TCP acknowledgement: penalizing long delays. | Susanne Albers, Helge Bals |
| 2003 | SPAA | Integrated prefetching and caching in single and parallel disk systems. | Susanne Albers, Markus Bttner |
| 2003 | WADS | Integrated Prefetching and Caching with Read and Write Requests. | Susanne Albers, Markus Bttner |
| 2002 | STOC | On randomized online scheduling. | Susanne Albers |
| 2002 | STOC | On paging with locality of reference. | Susanne Albers, Lene M. Favrholdt, Oliver Giel |
| 2001 | ESA | Some Algorithmic Problems in Large Networks. | Susanne Albers |
| 2000 | SPAA | Generalized connection caching. | Susanne Albers |
| 1999 | SODA | Page Replacement for General Caching Problems. | Susanne Albers, Sanjeev Arora, Sanjeev Khanna |
| 1999 | SODA | Exploring Unknown Environments with Obstacles. | Susanne Albers, Klaus Kursawe, Sven Schuierer |
| 1999 | WG | Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. | Susanne Albers |
| 1998 | FOCS | Delayed Information and Action in On-line Algorithms. | Susanne Albers, Moses Charikar, Michael Mitzenmacher |
| 1998 | SODA | Average-Case Analyses of First Fit and Random Fit Bin Packing. | Susanne Albers, Michael Mitzenmacher |
| 1998 | STOC | Minimizing Stall Time in Single and Parallel Disk Systems. | Susanne Albers, Naveen Garg, Stefano Leonardi |
| 1997 | STOC | Better Bounds for Online Scheduling. | Susanne Albers |
| 1997 | STOC | Exploring Unknown Environments. | Susanne Albers, Monika Rauch Henzinger |
| 1996 | ICALP | Average Case Analyses of List Update Algorithms, with Applications to Data Compression. | Susanne Albers, Michael Mitzenmacher |
| 1995 | SODA | Improved Randomized On-Line Algorithms for the List Update Problem. | Susanne Albers |
| 1995 | WADS | Page Migration with Limited Local Memory Capacity. | Susanne Albers, Hisashi Koga |
| 1994 | MFCS | A Competitive Analysis of the List Update Problem with Lookahead. | Susanne Albers |
| 1993 | ESA | The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract). | Susanne Albers |
| 1992 | SODA | Improved Parallel Integer Sorting Without Concurrent Writing. | Susanne Albers, Torben Hagerup |