Andreas Tönnis

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions

Berthold Vöcking, Andreas Tönnis, Klaus Radke, 2013, ESA.

Hiring Secretaries over Time: The Benefit of Concurrent Employment

John Fearnley, Max Klimm, Daniel Schmand, 2016, Math. Oper. Res..

Primal beats dual on online packing LPs in the random-order model

Berthold Vöcking, Andreas Tönnis, Klaus Radke, 2013, STOC.

Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints

Andreas Tönnis, Thomas Kesselheim, Thomas Kesselheim, 2016, APPROX-RANDOM.

Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions

Andreas Tönnis, Thomas Kesselheim, Thomas Kesselheim, 2016, ESA.

Extensions of secretary problems towards submodular objectives and temporal arrival

Andreas Tönnis, Peter Rossmanith, Britta Peis, 2017 .

Online Appointment Scheduling in the Random Order Model

Andreas Tönnis, Thomas Kesselheim, Oliver Göbel, 2015, ESA.