Startseite
Personen
Susanne Albers
Publikationen
Ausgewählte Publikationen
S. Albers, S. Schubert. Optimal algorithms for online b-matching with variable vertex capacities . Algorithmica 87(2): 167-190, 2025. Preliminary version in APPROX21. S. Albers, S. Schubert. Online b-matching with stochastic rewards . In Proc. 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM25), Springer LNCS 15538, 37-50, 2025. S. Albers, G.W. van der Heijden. Online busy time scheduling with flexible jobs . In Proc. 18th Annual International Conference on Combinatorial Optimization and Applications (COCOA25), Springer LNCS, 2025. Best Paper Award. S. Albers, W. Gálvez, Ö.B. Özdemir. On the 2d demand bin packing problem: Hardness and approximation algorithm . In Proc. 13th Latin-American Symposium on Algorithms, Graphs and Optimization (LAGOS25), Procedia Computer Science, Elsevier, 301-308, 2025. S. Albers, J. Quedenfeld. Algorithms for right-sizing heterogeneous data-centers . ACM Transactions on Parallel Computing, 10(4): 20(1)-20(28), 2023. Preliminary version in SPAA21. S. Albers, J. Quedenfeld. Optimal algorithms for right-sizing data centers . ACM Transactions on Parallel Computing, 9(4): 15:1-15:40, 2022. Preliminary version in SPAA18. S. Albers, S. Schubert. Tight bounds for online matching in bounded-degree graphs with vertex capacities . In Proc. 30th Annual European Symposium on Algorithms (ESA22), LIPIcs 244, 4:1-4:14, 2022. S. Albers, S. Schubert. Online ad allocation in bounded-degree graphs . In Proc. 18th International Conference on Web and Internet Economics (WINE22), Springer LNCS 13778, 60-77, 2022. S. Albers, W. Galvez, M. Janke. Machine covering in the random-order model . Algorithmica, 85(6): 1560-1585, 2023. Preliminary version in ISAAC21. S. Albers, D. Kraft. On the value of penalties in time-inconsistent planning . ACM Transaction on Economics and Computation, 9(3): 17:1-17:18, 2021. Preliminary version in ICALP17. S. Albers, M. Janke. Scheduling in the random-order model . Algorithmica, 83(9): 2803-2832, 2021. Preliminary version in ICALP20. S. Albers, A. Khan, L. Ladewig. Improved online algorithms for knapsack and GAP in the random order model . Algorithmica, 83(6): 1750-1785, 2021. Preliminary version in APPROX19. S. Albers, S. Schraink. Tight bounds for online coloring of basic graph classes . Algorithmica, 83(1): 337–360, 2021. Preliminary version in ESA17. S. Albers, L. Ladewig. New results for the k-secretary problem . Theoretical Computer Science, 863: 102-119, 2021. Preliminary version in ISAAC19. S. Albers, A. Khan, L. Ladewig. Best Fit bin packing with random order revisited . Algorithmica, 83(9): 2833-2858, 2021. Preliminary version in MFCS20 (Best Paper Award). S. Albers, J. Quedenfeld. Algorithms for energy conservation in heterogeneous data centers . Theoretical Computer Science. 896: 111-131, 2021. Preliminary version in CIAC21. S. Albers, M. Janke. Online makespan minimization with budgeted uncertainty . In Proc. 17th International Symposium on Algorithms and Data Structures (WADS21), Springer LNCS 12808, 43-56, 2021. S. Albers, M. Janke. Scheduling in the secretary model . In Proc. 41st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS21), LIPIcs 213, 6:1-2:22, 2021. S. Albers, M. Janke. New bounds for randomized list update in the paid exchange model . In Proc. 37th International Symposium on Theoretical Aspects of Computer Science, (STACS20), LIPIcs 154, 12:1-12:17, 2020. S. Albers, A. Eckl. Explorable uncertainty in scheduling with non-uniform testing times . In Proc. 18th Workshop on Approximation and Online Algorithms, (WAOA20), Springer LNCS 12806, 127-142, 2020. S. Albers, D. Kraft. Motivating time-inconsistent agents: A computational approach . Theory of Computing Systems, 63(3):466–487, 2019. Preliminary version in WINE16. S. Albers. On energy conservation in data centers . ACM Transactions on Parallel Computing, 6(3): 13:1-13:26, 2019. Preliminary version in SPAA'17. S. Albers, A. Passen. New online algorithms for story scheduling in web advertising . Algorithmica, 81(1):1-25, 2019. Preliminary version in ICALP13. S. Albers, D. Frascaria. Quantifying competitiveness in paging with locality of reference . Algorithmica, 80(12):3563-3596, 2018. S. Albers, D. Kraft. The price of uncertainty in present-biased planning . In Proc. 13th International Conference on Web and Internet Economics (WINE17), Springer LNCS, 2017. S. Albers, M. Hellwig. On the value of job migration in online makespan minimization . Algorithmica, 79(2):598-623, 2017. Preliminary version in ESA12. S. Albers, M. Hellwig. Online makespan minimization with parallel schedules . Algorithmica, 78(2):492-520, 2017. Preliminary version in SWAT14. S. Albers, E. Bampis, D. Letsios, G. Lucarelli, R. Stotz. Scheduling on power-heterogeneous processors . Information and Computation, 257:22-33, 2017. S. Albers, S. Lauer. On list update with locality of reference . Journal of Computer and System Sciences, 82(5):627-653, 2016. Preliminary version in ICALP08. S. Albers, A. Antoniadis, G. Greiner. On multi-processor speed scaling with migration . Journal of Computer and System Sciences, 81(7):1194-1209, 2015. Preliminary version in SPAA11. S. Albers, S. Eilts, E. Even-Dar, Y. Mansour and L. Roditty. On Nash equilibria for a network creation game . ACM Transactions on Economics and Computation, 2(1): 2:1-2:27, 2014. Preliminary version in SODA06. S. Albers, A. Antoniadis. Race to idle: New algorithms for speed scaling with a sleep state . ACM Transactions on Algorithms, 10(2):9, 2014. Preliminary version in SODA12. S. Albers, F. Müller, S. Schmelzer. Speed scaling on parallel processors . Algorithmica , 68(2): 404-425, 2014. Preliminary version in SPAA07. S. Albers. Recent advances for a classical scheduling problem . In Proc. 40th International Colloquium on Automata, Languages, and Programming (ICALP13), Springer LNCS 7966, 4-14, 2013. S. Albers, P. Lenzner. On approximate Nash equilibria in network design . Internet Mathematics, 9(4):384-405, 2013. S. Albers and M. Hellwig. Semi-online scheduling revisited . Theoretical Computer Science , 443:1-9, 2012. S. Albers. Algorithms for Dynamic Speed Scaling . In Proc. 28th International Symposium on Theoretical Aspects of Computer Science (STACS'11) , 1-11, 2011. S. Albers. Energy-efficient algorithms . Communications of the ACM , 86-96, 2010. S. Albers. New results on web caching with request reordering . Algorithmica , 58(2): 461-477, 2010. Preliminary version in SPAA04. S. Albers and T. Jacobs. An experimental study of new and known online packet buffering algorithms . Algorithmica , 57(4): 725-746, 2010. Preliminary version in ESA07. S. Albers. Online scheduling . In Introduction to Scheduling , edited by Yves Robert and Frederic Vivien. Chapman and Hall/CRC Press, 57-84, 2009. S. Albers. Resource management on large network . Book chapter in Algorithmics of Large and Complex Networks , Springer LNCS 5515, 227-246, 2009. S. Albers. On the value of coordination in network design . SIAM Journal on Computing , 38(6): 2273-2302, 2009. Preliminary version in SODA08. S. Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization . ACM Transactions on Algorithms , 3(4): 49, 2007. Preliminary version in STACS06. S. Albers and R. van Stee. A study of integrated document and connection caching . Algorithmica , 47(3) : 239-252, 2007. Preliminary version in ICALP03. S. Albers. Online algorithms . In Interactive Computation: The New Paradigm edited by D.Q. Goldin, S.A. Smolka and P. Wegner, 143-164, 2006. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering . SIAM Journal on Computin g, 35(2): 278-304, 2005. Preliminary version in STOC04. S. Albers, L.M. Favrholdt and O. Giel. On paging with locality of reference . Journal of Computer and System Sciences, 70:145-175, 2005. Preliminary version in STOC02. S. Albers and H. Bals. Dynamic TCP acknowledgement: Penalizing long delays . SIAM Journal on Discrete Mathematics , 19(4):938-95, 2005. Preliminary version in SODA03. S. Albers and M. Büttner. Integrated prefetching and caching in single and parallel disk systems . Information and Computation, 198:24-39, 2005. Preliminary version in SPAA03. S. Albers and M. Büttner. Integrated prefetching and caching with read and write requests . In Proc. 8th International Workshop on Algorithms and Data Structures (WADS'03), Springer LNCS 2748, pages 162-173, 2003. S. Albers. Online algorithms: A survey . Mathematical Programming, 97:3-26, 2003. Invited paper at ISMP 2003. S. Albers. On randomized online scheduling . In Proc. 34th ACM Symposium on Theory of Computing, pages 134-143, 2002. S. Albers and B. Schröder. An experimental study of online scheduling algorithms . ACM Journal of Experimental Algorithmics , 7, 2002. S. Albers and M. Karpinski. Randomized splay trees: Theoretical and experimental results . Information Processing Letters, 81:213-221, 2002. S. Albers. Generalized connection caching . Theory of Computing Systems , 35:251-267, 2002. Invited to the journal's special issue dedicated to SPAA00. S. Albers, K. Kursawe and S. Schuierer. Exploring unknown environments with obstacles . Algorithmica 32:123-143, 2002. Preliminary version in SODA 99. S. Albers, M. Charikar and M. Mitzenmacher. On delayed information and action in online algorithms . Information and Computation 170:135-152, 2001. Preliminary version in FOCS 98. S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows . In Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX01), Springer LNCS Volume 2129, pages 12-23, 2001. S. Albers and G. Schmidt. Scheduling with unexpected machine breakdowns . Discrete Applied Mathematics, 110:85-99, 2001. Invited contribution in APPROX 99. S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems . Journal of the ACM , 47:969-986, 2000. Premininary version in STOC98. S. Albers, S. Arora and S. Khanna. Page replacement for general caching problems . In Proc. 10th Annual ACM-SIAM Symposium Discrete Algorithms (SODA99) , pages 31-40, 1999. S. Albers and S. Leonardi. Online algorithms . In ACM Computing Surveys , 1999. S. Albers and M. Mitzenmacher. Average case analyses of First-Fit and Random-Fit bin packing . Random Structures and Algorithms , 16:240-259, 2000. Preliminary version in SODA99. S. Albers and M.R. Henzinger. Exploring unknown environments . SIAM Journal on Computing , 29:1164-1188, 2000. Preliminary version in STOC97. S. Albers. Better bounds for online scheduling . SIAM Journal on Computing , 29:459-473, 1999. Preliminary version in STOC 97. S. Albers. Online algorithms: A study of graph-theoretic concepts . Invited lecture in Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG99) , Springer LNCS 1665, pages 10-26, 1999. S. Albers. Improved randomized on-line algorithms for the list update problem . SIAM Journal on Computing , 27:682-693, 1998. Preliminary version in SODA95. S. Albers and H. Koga. New on-line algorithms for the page replication problem . In Journal of Algorithms , 27:75-96, 1998. Preliminary version in SWAT94. S. Albers and M. Mitzenmacher. Average case analyses of list update algorithms, with applications to data compression . In Algorithmica , 21:312-329, 1998. Preliminary version in ICALP96. S. Albers. A competitive analysis of the list update problem with lookahead . Theoretical Computer Science , 197:95-109, 1998. S. Albers and M.Mitzenmacher. Revisiting the COUNTER algorithms for list update . Information Processing Letters , 64:155-160, 1997. S. Albers. On the influence of lookahead in competitive paging algorithms . Algorithmica , 18:283-305, 1997. Preliminary version in ESA93. S. Albers and J. Westbrook. Self-organizing data structures . In Online Algorithms: The State of the Art, edited by Amos Fiat and Gerhard Woeginger. Springer LNCS 1442, pages 31-51, 1996. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing . Information and Computation , 136:25-51, 1997. Preliminary version in SODA92. S. Albers, B. von Stengel and R. Werchner. A combined BIT and TIMESTAMP algorithm for the list update problem . Information Processing Letters , 56:135-139, 1995. S. Albers and H. Koga. Page migration with limited local memory capacity . In Proc. 4th International Workshop on Algorithms and Data Structures (WADS95) , Springer LNCS, Volume 955, pages 147-158, 1995. S. Albers and P. Brucker. The complexity of one-machine batching problems. Discrete Applied Mathematics , 47:87-107, 1993.
