Andreas Tönnis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Submodular secretary problems: cardinality, matching, and linear constraints (available as arXiv preprint)	2021-07-28	Paper
\textsc{Superset}: A (super)natural variant of the card game \textsc{Set}	2020-08-11	Paper
Hiring secretaries over time: the benefit of concurrent employment Mathematics of Operations Research	2020-04-30	Paper
A collection of lower bounds for online matching on the line (available as arXiv preprint)	2020-02-12	Paper
The online best reply algorithm for resource allocation problems (available as arXiv preprint)	2020-02-04	Paper
The online best reply algorithm for resource allocation problems	2020-02-04	Paper
Primal beats dual on online packing LPs in the random-order model SIAM Journal on Computing	2018-11-07	Paper
Think eternally: improved algorithms for the temp secretary problem and extensions (available as arXiv preprint)	2018-03-02	Paper
Online appointment scheduling in the random order model Algorithms - ESA 2015	2015-11-19	Paper
Primal beats dual on online packing LPs in the random-order model Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions Lecture Notes in Computer Science	2013-09-17	Paper

Research outcomes over time

This page was built for person: Andreas Tönnis