| An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions T Kesselheim, K Radke, A Tönnis, B Vöcking European Symposium on Algorithms (ESA 2013), 589-600, 2013 | 178 | 2013 |
| Primal beats dual on online packing LPs in the random-order model T Kesselheim, A Tönnis, K Radke, B Vöcking Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 303-312, 2014 | 143 | 2014 |
| Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints T Kesselheim, A Tönnis APPROX/RANDOM 2017, 16:1 - 16:22, 2017 | 22 | 2017 |
| A Collection of Lower Bounds for Online Matching on the Line A Antoniadis, C Fischer, A Tönnis Latin American Symposium on Theoretical Informatics, 52-65, 2018 | 21 | 2018 |
| Online Appointment Scheduling in the Random Order Model O Göbel, T Kesselheim, A Tönnis European Symposium on Algorithms (ESA 2015), 680-692, 2015 | 11 | 2015 |
| The online best reply algorithm for resource allocation problems M Klimm, D Schmand, A Tönnis International Symposium on Algorithmic Game Theory, 200-215, 2019 | 10 | 2019 |
| Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions T Kesselheim, A Tönnis European Symposium on Algorithms (ESA 2016), 2016 | 10 | 2016 |
| Hiring secretaries over time: The benefit of concurrent employment Y Disser, J Fearnley, M Gairing, O Göbel, M Klimm, D Schmand, ... Mathematics of Operations Research 45 (1), 323-352, 2020 | 8 | 2020 |
| Hiring secretaries over time: The benefit of concurrent employment Y Disser, J Fearnley, M Gairing, O Göbel, M Klimm, D Schmand, ... Mathematics of Operations Research 45 (1), 323-352, 2020 | 8 | 2020 |
| Prophet Inequalities over Time A Abels, E Pitschmann, D Schmand Proceedings of the 24th ACM Conference on Economics and Computation, 1-20, 2023 | 5 | 2023 |
| SUPERSET: A (Super) Natural Variant of the Card Game SET F Botler, A Cristi, R Hoeksma, K Schewior, A Tönnis 9th International Conference on Fun with Algorithms (FUN 2018), 2018 | 1 | 2018 |
| Knapsack Secretary Through Boosting A Abels, L Ladewig, K Schewior, M Stinzendörfer International Workshop on Approximation and Online Algorithms, 61-81, 2022 | | 2022 |
| Extensions of secretary problems towards submodular objectives and temporal arrival A Tönnis Dissertation, RWTH Aachen University, 2017, 2017 | | 2017 |
Thomas KesselheimUniversity of BonnE-mail confirmado em uni-bonn.de
