An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (ESA, 2013)

Mechanism Design for Combinatorial Auctions. - Andreas Tönnis (Joint Workshop of the German Research Training Groups in Computer Science, 2014)

Online Appointment Scheduling in the Random Order Model. - Oliver Göbel 002; Thomas Kesselheim; Andreas Tönnis (ESA, 2015)

Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. - Thomas Kesselheim; Andreas Tönnis (ESA, 2016)

Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. - Thomas Kesselheim; Andreas Tönnis (APPROX-RANDOM, 2017)

SUPERSET: A (Super)Natural Variant of the Card Game SET. - Fábio Botler; Andrés Cristi; Ruben Hoeksma; Kevin Schewior; Andreas Tönnis (FUN, 2018)

A Collection of Lower Bounds for Online Matching on the Line. - Antonios Antoniadis 001; Carsten Fischer; Andreas Tönnis (LATIN, 2018)

Online Best Reply Algorithms for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (CoRR, 2018)

Primal Beats Dual on Online Packing LPs in the Random-Order Model. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (SIAM J. Comput., 2018)

The Online Best Reply Algorithm for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (SAGT, 2019)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

Knapsack Secretary Through Boosting. - Andreas Abels; Leon Ladewig; Kevin Schewior; Moritz Stinzendörfer (WAOA, 2022)

Prophet Inequalities over Time. - Andreas Abels; Elias Pitschmann; Daniel Schmand (EC, 2023)

Interval-Constrained Bipartite Matching over Time. - Andreas Abels; Mariia Anapolska (CoRR, 2024)