Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusanne Albers
Person information
- affiliation: Technical University Munich, Germany
- affiliation: Saarland University, Saarbrücken, Germany
- award (2008): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j63]Susanne Albers
, Jens Quedenfeld:
Optimal Algorithms for Right-sizing Data Centers. ACM Trans. Parallel Comput. 9(4): 15:1-15:40 (2022)- [c75]Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. ESA 2022: 4:1-4:16 - [c74]Susanne Albers, Sebastian Schubert:
Online Ad Allocation in Bounded-Degree Graphs. WINE 2022: 60-77 - [p5]Susanne Albers:
Energy-Efficient Scheduling. Algorithms for Big Data 2022: 196-212 - [i25]Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. CoRR abs/2206.15336 (2022) - 2021
- [j62]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. Algorithmica 83(1): 337-360 (2021) - [j61]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. Algorithmica 83(6): 1750-1785 (2021) - [j60]Susanne Albers, Maximilian Janke:
Scheduling in the Random-Order Model. Algorithmica 83(9): 2803-2832 (2021) - [j59]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. Algorithmica 83(9): 2833-2858 (2021) - [j58]Susanne Albers, Leon Ladewig:
New results for the k-secretary problem. Theor. Comput. Sci. 863: 102-119 (2021) - [j57]Susanne Albers, Jens Quedenfeld:
Algorithms for energy conservation in heterogeneous data centers. Theor. Comput. Sci. 896: 111-131 (2021) - [j56]Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. ACM Trans. Economics and Comput. 9(3): 17:1-17:18 (2021) - [c73]Susanne Albers, Sebastian Schubert:
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. APPROX-RANDOM 2021: 2:1-2:18 - [c72]Susanne Albers, Jens Quedenfeld:
Algorithms for Energy Conservation in Heterogeneous Data Centers. CIAC 2021: 75-89 - [c71]Susanne Albers, Maximilian Janke:
Scheduling in the Secretary Model. FSTTCS 2021: 6:1-6:22 - [c70]Susanne Albers, Waldo Gálvez, Maximilian Janke:
Machine Covering in the Random-Order Model. ISAAC 2021: 52:1-52:16 - [c69]Susanne Albers, Jens Quedenfeld:
Algorithms for Right-Sizing Heterogeneous Data Centers. SPAA 2021: 48-58 - [c68]Susanne Albers, Alexander Eckl:
Scheduling with Testing on Multiple Identical Parallel Machines. WADS 2021: 29-42 - [c67]Susanne Albers, Maximilian Janke:
Online Makespan Minimization with Budgeted Uncertainty. WADS 2021: 43-56 - [i24]Susanne Albers, Maximilian Janke:
Scheduling in the Secretary Model. CoRR abs/2103.16340 (2021) - [i23]Susanne Albers, Alexander Eckl:
Scheduling with Testing on Multiple Identical Parallel Machines. CoRR abs/2105.02052 (2021) - [i22]Susanne Albers, Jens Quedenfeld:
Algorithms for Energy Conservation in Heterogeneous Data Centers. CoRR abs/2107.14672 (2021) - [i21]Susanne Albers, Jens Quedenfeld:
Algorithms for Right-Sizing Heterogeneous Data Centers. CoRR abs/2107.14692 (2021) - [i20]Susanne Albers, Waldo Gálvez, Maximilian Janke:
Machine Covering in the Random-Order Model. CoRR abs/2110.09161 (2021) - 2020
- [j55]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [c66]Susanne Albers, Maximilian Janke:
Scheduling in the Random-Order Model. ICALP 2020: 68:1-68:18 - [c65]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. MFCS 2020: 7:1-7:15 - [c64]Susanne Albers, Maximilian Janke:
New Bounds for Randomized List Update in the Paid Exchange Model. STACS 2020: 12:1-12:17 - [c63]Susanne Albers, Alexander Eckl:
Explorable Uncertainty in Scheduling with Non-uniform Testing Times. WAOA 2020: 127-142 - [e10]Susanne Albers:
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands. LIPIcs 162, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-150-4 [contents] - [i19]Susanne Albers, Maximilian Janke:
Scheduling in the Random-Order Model. CoRR abs/2006.00386 (2020) - [i18]Susanne Albers, Alexander Eckl:
Explorable Uncertainty in Scheduling with Non-Uniform Testing Times. CoRR abs/2009.13316 (2020) - [i17]Susanne Albers, Leon Ladewig:
New Results for the k-Secretary Problem. CoRR abs/2012.00488 (2020) - [i16]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. CoRR abs/2012.00497 (2020) - [i15]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. CoRR abs/2012.00511 (2020)
2010 – 2019
- 2019
- [j54]Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. Algorithmica 81(1): 1-25 (2019) - [j53]David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone:
EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS 129 (2019) - [j52]Susanne Albers, Dennis Kraft:
Motivating Time-Inconsistent Agents: A Computational Approach. Theory Comput. Syst. 63(3): 466-487 (2019) - [j51]Susanne Albers:
On Energy Conservation in Data Centers. ACM Trans. Parallel Comput. 6(3): 13:1-13:26 (2019) - [c62]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. APPROX-RANDOM 2019: 22:1-22:23 - [c61]Susanne Albers, Leon Ladewig:
New Results for the k-Secretary Problem. ISAAC 2019: 18:1-18:19 - [i14]Alexander Eckl, Luisa Peter, Maximilian Schiffer, Susanne Albers:
Minimization of Weighted Completion Times in Path-based Coflow Scheduling. CoRR abs/1911.13085 (2019) - 2018
- [j50]Susanne Albers, Dario Frascaria:
Quantifying Competitiveness in Paging with Locality of Reference. Algorithmica 80(12): 3563-3596 (2018) - [c60]Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers. SPAA 2018: 363-372 - [i13]Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers - Extended Version. CoRR abs/1807.05112 (2018) - 2017
- [j49]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. Algorithmica 78(2): 492-520 (2017) - [j48]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. Algorithmica 79(2): 598-623 (2017) - [j47]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on power-heterogeneous processors. Inf. Comput. 257: 22-33 (2017) - [j46]Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch:
Algorithmic Economics und Operations Research. Inform. Spektrum 40(2): 165-171 (2017) - [c59]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. ESA 2017: 7:1-7:14 - [c58]Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. ICALP 2017: 10:1-10:12 - [c57]Susanne Albers:
On Energy Conservation in Data Centers. SPAA 2017: 35-44 - [c56]Susanne Albers, Dennis Kraft:
The Price of Uncertainty in Present-Biased Planning. WINE 2017: 325-339 - [p4]Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch:
Algorithmic Economics und Operations Research. 50 Jahre Universitäts-Informatik in München 2017: 129-139 - [i12]Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. CoRR abs/1702.01677 (2017) - [i11]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. CoRR abs/1702.07172 (2017) - [i10]Susanne Albers, Dennis Kraft:
The Price of Uncertainty in Present-Biased Planning. CoRR abs/1708.07715 (2017) - 2016
- [j45]Susanne Albers, Sonja Lauer:
On list update with locality of reference. J. Comput. Syst. Sci. 82(5): 627-653 (2016) - [c55]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on Power-Heterogeneous Processors. LATIN 2016: 41-54 - [c54]Susanne Albers, Dennis Kraft:
Motivating Time-Inconsistent Agents: A Computational Approach. WINE 2016: 309-323 - [i9]Susanne Albers, Dennis Kraft:
Motivating Time-Inconsistent Agents: A Computational Approach. CoRR abs/1601.00479 (2016) - 2015
- [j44]Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration. J. Comput. Syst. Sci. 81(7): 1194-1209 (2015) - [c53]Susanne Albers:
Modeling Real-World Data Sets (Invited Talk). SoCG 2015: 872-872 - [c52]Susanne Albers, Dario Frascaria:
Quantifying Competitiveness in Paging with Locality of Reference. ICALP (1) 2015: 26-38 - 2014
- [j43]Susanne Albers, Fabian Müller, Swen Schmelzer:
Speed Scaling on Parallel Processors. Algorithmica 68(2): 404-425 (2014) - [j42]Susanne Albers, Antonios Antoniadis:
Race to idle: New algorithms for speed scaling with a sleep state. ACM Trans. Algorithms 10(2): 9:1-9:31 (2014) - [j41]Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty:
On Nash Equilibria for a Network Creation Game. ACM Trans. Economics and Comput. 2(1): 2:1-2:27 (2014) - [c51]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. SWAT 2014: 13-25 - 2013
- [j40]Susanne Albers, Pascal Lenzner:
On Approximate Nash Equilibria in Network Design. Internet Math. 9(4): 384-405 (2013) - [c50]Susanne Albers:
Recent Results for Online Makespan Minimization. COCOON 2013: 1-3 - [c49]Susanne Albers:
Recent Advances for a Classical Scheduling Problem. ICALP (2) 2013: 4-14 - [c48]Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. ICALP (2) 2013: 446-458 - [i8]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. CoRR abs/1304.5625 (2013) - [i7]Susanne Albers, Onno J. Boxma, Kirk Pruhs:
Scheduling (Dagstuhl Seminar 13111). Dagstuhl Reports 3(3): 24-50 (2013) - 2012
- [j39]Susanne Albers, Matthias Hellwig:
Semi-online scheduling revisited. Theor. Comput. Sci. 443: 1-9 (2012) - [c47]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. ESA 2012: 84-95 - [c46]Susanne Albers, Antonios Antoniadis:
Race to idle: new algorithms for speed scaling with a sleep state. SODA 2012: 1266-1285 - 2011
- [j38]Susanne Albers, Jean-Yves Marion:
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011) - [j37]Susanne Albers, Alberto Marchetti-Spaccamela:
Preface. Theor. Comput. Sci. 412(24): 2563 (2011) - [c45]Susanne Albers:
Energy-Efficient Algorithms (Invited Talk). FSTTCS 2011: 1-2 - [c44]Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288 - [c43]Susanne Albers:
Algorithms for Dynamic Speed Scaling. STACS 2011: 1-11 - [p3]Susanne Albers, Swen Schmelzer:
Online Algorithms - What Is It Worth to Know the Future? Algorithms Unplugged 2011: 361-366 - [i6]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. CoRR abs/1111.0773 (2011) - 2010
- [j36]Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. Algorithmica 57(4): 725-746 (2010) - [j35]Susanne Albers:
New Results on Web Caching with Request Reordering. Algorithmica 58(2): 461-477 (2010) - [j34]Susanne Albers:
Energy-efficient algorithms. Commun. ACM 53(5): 86-96 (2010) - [j33]Susanne Albers:
Onlinealgorithmen - Was ist es wert, die Zukunft zu kennen? Inform. Spektrum 33(5): 438-443 (2010) - [j32]Susanne Albers, Pascal Weil:
STACS 2008 Foreword. Theory Comput. Syst. 47(3): 611-612 (2010) - [j31]Susanne Albers:
Editorial Note. ACM Trans. Algorithms 6(2): 22:1 (2010) - [j30]Susanne Albers:
Editorial note. ACM Trans. Algorithms 6(4): 57:1 (2010) - [c42]Susanne Albers:
Algorithms for Energy Management. CSR 2010: 1-11 - [c41]Susanne Albers, Pascal Lenzner:
On Approximate Nash Equilibria in Network Design. WINE 2010: 14-25 - [e9]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
Scheduling, 14.02. - 19.02.2010. Dagstuhl Seminar Proceedings 10071, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i5]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Abstracts Collection - Scheduling. Scheduling 2010 - [i4]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Executive Summary - Scheduling. Scheduling 2010
2000 – 2009
- 2009
- [j29]Susanne Albers:
On the Value of Coordination in Network Design. SIAM J. Comput. 38(6): 2273-2302 (2009) - [c40]Susanne Albers:
Algorithms for Energy Saving. Efficient Algorithms 2009: 173-186 - [c39]Susanne Albers:
Resource Management in Large Networks. Algorithmics of Large and Complex Networks 2009: 227-246 - [c38]Susanne Albers, Jean-Yves Marion:
Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009 - [p2]Susanne Albers:
Online Scheduling. Introduction to Scheduling 2009: 51-77 - [e8]Susanne Albers, Helmut Alt, Stefan Näher:
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5760, Springer 2009, ISBN 978-3-642-03455-8 [contents] - [e7]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas:
Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Lecture Notes in Computer Science 5555, Springer 2009, ISBN 978-3-642-02926-4 [contents] - [e6]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas:
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II. Lecture Notes in Computer Science 5556, Springer 2009, ISBN 978-3-642-02929-5 [contents] - [e5]Susanne Albers, Jean-Yves Marion:
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. LIPIcs 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009, ISBN 978-3-939897-09-5 [contents] - 2008
- [c37]Susanne Albers, Sonja Lauer:
On List Update with Locality of Reference. ICALP (1) 2008: 96-107 - [c36]Susanne Albers:
On the value of coordination in network design. SODA 2008: 294-303 - [c35]Susanne Albers, Pascal Weil:
Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6 - [c34]Susanne Albers, Pascal Weil:
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008 - [p1]Susanne Albers, Swen Schmelzer:
Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?. Taschenbuch der Algorithmen 2008: 389-394 - [e4]Susanne Albers, Pascal Weil:
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. LIPIcs 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r2]Susanne Albers:
Online List Update. Encyclopedia of Algorithms 2008 - 2007
- [j28]Susanne Albers, Rob van Stee:
A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007) - [j27]Susanne Albers, Hiroshi Fujiwara:
Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4): 49 (2007) - [c33]Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. ESA 2007: 754-765 - [c32]Susanne Albers, Fabian Müller, Swen Schmelzer:
Speed scaling on parallel processors. SPAA 2007: 289-298 - [r1]Susanne Albers:
Online Computation in Large Networks. Handbook of Parallel Computing 2007 - 2006
- [j26]Susanne Albers, Tomasz Radzik:
Foreword. Algorithmica 45(1): 1-2 (2006) - [c31]Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty:
On nash equilibria for a network creation game. SODA 2006: 89-98 - [c30]Susanne Albers, Hiroshi Fujiwara:
Energy-Efficient Algorithms for Flow Time Minimization. STACS 2006: 621-633 - 2005
- [j25]Susanne Albers, Markus Büttner:
Integrated prefetching and caching in single and parallel disk systems. Inf. Comput. 198(1): 24-39 (2005) - [j24]Susanne Albers, Lene M. Favrholdt, Oliver Giel:
On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005) - [j23]Susanne Albers, Markus Schmidt:
On the Performance of Greedy Algorithms in Packet Buffering. SIAM J. Comput. 35(2): 278-304 (2005) - [j22]Susanne Albers, Helge Bals:
Dynamic TCP Acknowledgment: Penalizing Long Delays. SIAM J. Discret. Math. 19(4): 938-951 (2005) - [e3]Susanne Albers, Robert Sedgewick, Dorothea Wagner:
Data Structures, 22.-27. February 2004. Dagstuhl Seminar Proceedings 04091, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [e2]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
Algorithms for Optimization with Incomplete Information, 16.-21. January 2005. Dagstuhl Seminar Proceedings 05031, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i3]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005 - [i2]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Summary-- Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [c29]Susanne Albers:
New results on web caching with request reordering. SPAA 2004: 84-92 - [c28]Susanne Albers, Markus Schmidt:
On the performance of greedy algorithms in packet buffering. STOC 2004: 35-44 - [e1]Susanne Albers, Tomasz Radzik:
Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3221, Springer 2004, ISBN 3-540-23025-4 [contents] - [i1]