Informatics 14 - Chair of Algorithms and Complexity - Research output

2025

Online b-Matching with Stochastic Rewards

Albers, S. & Schubert, S., 2025, SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Proceedings. Královič, R. & Kůrková, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 37-50 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 15538 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2024

Optimal Algorithms for Online b-Matching with Variable Vertex Capacities

Albers, S. & Schubert, S., 2024, (Accepted/In press) In: Algorithmica.

Research output: Contribution to journal › Article › peer-review

Open Access

1 Scopus citations

2023

Algorithms for Right-sizing Heterogeneous Data Centers

Albers, S. & Quedenfeld, J., 14 Dec 2023, In: ACM Transactions on Parallel Computing. 10, 4, 20.

Research output: Contribution to journal › Article › peer-review

Open Access

Machine Covering in the Random-Order Model

Albers, S., Gálvez, W. & Janke, M., Jun 2023, In: Algorithmica. 85, 6, p. 1560-1585 26 p.

Research output: Contribution to journal › Article › peer-review

Open Access

3 Scopus citations

2022

Energy-Efficient Scheduling

Albers, S., 2022, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, p. 196-212 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13201 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Open Access

Memories on Vladimir Gerdt

Mayr, E. W., Seiler, W. M. & Vorozhtsov, E. V., 1 Mar 2022, In: Journal of Symbolic Computation. 109, p. 50-56 7 p.

Research output: Contribution to journal › Article › peer-review

Online Ad Allocation in Bounded-Degree Graphs

Albers, S. & Schubert, S., 2022, Web and Internet Economics - 18th International Conference, WINE 2022, Proceedings. Hansen, K. A., Liu, T. X. & Malekian, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 60-77 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13778 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Optimal Algorithms for Right-sizing Data Centers

Albers, S. & Quedenfeld, J., 16 Dec 2022, In: ACM Transactions on Parallel Computing. 9, 4, 15.

Research output: Contribution to journal › Article › peer-review

Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

Albers, S. & Schubert, S., 1 Sep 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

2021

Algorithms for energy conservation in heterogeneous data centers

Albers, S. & Quedenfeld, J., 6 Dec 2021, In: Theoretical Computer Science. 896, p. 111-131 21 p.

Research output: Contribution to journal › Article › peer-review

Open Access

2 Scopus citations

Algorithms for Energy Conservation in Heterogeneous Data Centers

Albers, S. & Quedenfeld, J., 2021, Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. Calamoneri, T. & Corò, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 75-89 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12701 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

1 Scopus citations

Algorithms for right-sizing heterogeneous data centers

Albers, S. & Quedenfeld, J., 6 Jul 2021, SPAA 2021 - Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 48-58 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

3 Scopus citations

Best Fit Bin Packing with Random Order Revisited

Albers, S., Khan, A. & Ladewig, L., Sep 2021, In: Algorithmica. 83, 9, p. 2833-2858 26 p.

Research output: Contribution to journal › Article › peer-review

Open Access

16 Scopus citations

Explorable Uncertainty in Scheduling with Non-uniform Testing Times

Albers, S. & Eckl, A., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 127-142 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

12 Scopus citations

Improved Online Algorithms for Knapsack and GAP in the Random Order Model

Albers, S., Khan, A. & Ladewig, L., Jun 2021, In: Algorithmica. 83, 6, p. 1750-1785 36 p.

Research output: Contribution to journal › Article › peer-review

Open Access

21 Scopus citations

Machine Covering in the Random-Order Model

Albers, S., Gálvez, W. & Janke, M., 1 Dec 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H.-K. & Sadakane, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 212).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

New results for the k-secretary problem

Albers, S. & Ladewig, L., 8 Apr 2021, In: Theoretical Computer Science. 863, p. 102-119 18 p.

Research output: Contribution to journal › Article › peer-review

Open Access

9 Scopus citations

Online Makespan Minimization with Budgeted Uncertainty

Albers, S. & Janke, M., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 43-56 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

On the Value of Penalties in Time-Inconsistent Planning

Albers, S. & Kraft, D., Sep 2021, In: ACM Transactions on Economics and Computation. 9, 3, 17.

Research output: Contribution to journal › Article › peer-review

Open Access

2 Scopus citations

Optimal algorithms for online b-matching with variable vertex capacities

Albers, S. & Schubert, S., 1 Sep 2021, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021. Wootters, M. & Sanita, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 207).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Scheduling in the Random-Order Model

Albers, S. & Janke, M., Sep 2021, In: Algorithmica. 83, 9, p. 2803-2832 30 p.

Research output: Contribution to journal › Article › peer-review

Open Access

5 Scopus citations

Scheduling in the Secretary Model

Albers, S. & Janke, M., 1 Dec 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021. Bojanczyk, M. & Chekuri, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 213).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Scheduling with Testing on Multiple Identical Parallel Machines

Albers, S. & Eckl, A., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 29-42 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Tight Bounds for Online Coloring of Basic Graph Classes

Albers, S. & Schraink, S., Jan 2021, In: Algorithmica. 83, 1, p. 337-360 24 p.

Research output: Contribution to journal › Article › peer-review

Open Access

4 Scopus citations

2020

Best fit bin packing with random order revisited

Albers, S., Khan, A. & Ladewig, L., 1 Aug 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J., Kral�, D. & Kral�, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, MFCS-2020-7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 170).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

New bounds for randomized list update in the paid exchange model

Albers, S. & Janke, M., Mar 2020, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. Paul, C. & Blaser, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-STACS-2020-12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 154).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Scheduling in the random-order model

Albers, S. & Janke, M., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 68. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

2019

Improved online algorithms for knapsack and GAP in the random order model

Albers, S., Khan, A. & Ladewig, L., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Motivating Time-Inconsistent Agents: A Computational Approach

Albers, S. & Kraft, D., 15 Apr 2019, In: Theory of Computing Systems. 63, 3, p. 466-487 22 p.

Research output: Contribution to journal › Article › peer-review

Open Access

10 Scopus citations

New Online Algorithms for Story Scheduling in Web Advertising

Albers, S. & Passen, A., 15 Jan 2019, In: Algorithmica. 81, 1, p. 1-25 25 p.

Research output: Contribution to journal › Article › peer-review

Open Access

3 Scopus citations

New results for the k-secretary problem

Albers, S. & Ladewig, L., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

On energy conservation in data centers

Albers, S., Oct 2019, In: ACM Transactions on Parallel Computing. 6, 3, A13.

Research output: Contribution to journal › Article › peer-review

Open Access

9 Scopus citations

2018

Complexity of membership problems of different types of polynomial ideals

Mayr, E. W. & Toman, S., 1 Jan 2018, Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory. Springer International Publishing, p. 481-493 13 p.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Scopus citations

Optimal algorithms for right-sizing data centers

Albers, S. & Quedenfeld, J., 11 Jul 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 363-372 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

19 Scopus citations

Quantifying Competitiveness in Paging with Locality of Reference

Albers, S. & Frascaria, D., 1 Dec 2018, In: Algorithmica. 80, 12, p. 3563-3596 34 p.

Research output: Contribution to journal › Article › peer-review

Open Access

3 Scopus citations

2017

Algorithmic economics and operations research

Albers, S., Bichler, M., Brandt, F., Gritzmann, P. & Kolisch, R., 2017, In: Informatik-Spektrum. 40, 2, p. 165-171 7 p.

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Editorial: Special Issue on “Theoretical Aspects of Computer Science” (STACS 2015)

Mayr, E. W., 1 Nov 2017, In: Theory of Computing Systems. 61, 4, p. 945-947 3 p.

Research output: Contribution to journal › Editorial

Open Access

On energy conservation in data centers

Albers, S., 24 Jul 2017, SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 35-44 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. Part F129316).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

13 Scopus citations

Online Makespan Minimization with Parallel Schedules

Albers, S. & Hellwig, M., 1 Jun 2017, In: Algorithmica. 78, 2, p. 492-520 29 p.

Research output: Contribution to journal › Article › peer-review

Open Access

16 Scopus citations

On the Value of Job Migration in Online Makespan Minimization

Albers, S. & Hellwig, M., 1 Oct 2017, In: Algorithmica. 79, 2, p. 598-623 26 p.

Research output: Contribution to journal › Article › peer-review

Open Access

9 Scopus citations

On the value of penalties in time-inconsistent planning

Albers, S. & Kraft, D., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Scheduling on power-heterogeneous processors

Albers, S., Bampis, E., Letsios, D., Lucarelli, G. & Stotz, R., Dec 2017, In: Information and Computation. 257, p. 22-33 12 p.

Research output: Contribution to journal › Article › peer-review

Open Access

4 Scopus citations

The price of uncertainty in present-biased planning

Albers, S. & Kraft, D., 2017, Web and Internet Economics - 13th International Conference, WINE 2017, Proceedings. Devanur, N. R. & Lu, P. (eds.). Springer Verlag, p. 325-339 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10660 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

6 Scopus citations

Tight bounds for online coloring of basic graph classes

Albers, S. & Schraink, S., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

2016

Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities

Mayr, E. W. & Weihmann, J., 4 Mar 2016, In: Fundamenta Informaticae. 143, 3-4, p. 355-391 37 p.

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Motivating time-inconsistent agents: A computational approach

Albers, S. & Kraft, D., 2016, Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings. Vetta, A. & Cai, Y. (eds.). Springer Verlag, p. 309-323 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10123 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

4 Scopus citations

On list update with locality of reference

Albers, S. & Lauer, S., 1 Aug 2016, In: Journal of Computer and System Sciences. 82, 5, p. 627-653 27 p.

Research output: Contribution to journal › Article › peer-review

Open Access

5 Scopus citations

Preface

Mayr, E. W., 2016, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9224 LNCS, p. v

Research output: Contribution to journal › Editorial

Scheduling on power-heterogeneous processors

Albers, S., Bampis, E., Letsios, D., Lucarelli, G. & Stotz, R., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). Springer Verlag, p. 41-54 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

8 Scopus citations

2015

Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms

Mayr, E. W. & Weihmann, J., 2015, In: Fundamenta Informaticae. 137, 1, p. 61-86 26 p.

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Informatics 14 - Chair of Algorithms and Complexity

Research output

Search results