Skip to main navigation Skip to search Skip to main content

Informatics 14 - Chair of Algorithms and Complexity

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • 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 proceedingConference contributionpeer-review

  • On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms

    Albers, S., Gálvez, W. & Özdemir, Ö. B., 2025, In: Procedia Computer Science. 273, p. 301-308 8 p.

    Research output: Contribution to journalConference articlepeer-review

    Open Access
  • Optimal Algorithms for Online b-Matching with Variable Vertex Capacities

    Albers, S. & Schubert, S., Feb 2025, In: Algorithmica. 87, 2, p. 167-190 24 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    1 Scopus citations